Pages with the fewest revisions

Showing below up to 50 results in range #1 to #50.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

1. Greene-Kleitman theorem‏‎ (2 revisions)
2. Edge-independent spanning trees‏‎ (2 revisions)
3. Lehman's theorem‏‎ (2 revisions)
4. Are there deletion-contraction formulas for the polymatroid Tutte polynomial?‏‎ (2 revisions)
5. Submodular function‏‎ (2 revisions)
6. Orientation with degree bounds‏‎ (2 revisions)
7. Talk:Skew-supermodular list colouring‏‎ (2 revisions)
8. Talk:Characterization of dual-critical graphs‏‎ (2 revisions)
9. Problem of the month January 2011‏‎ (2 revisions)
10. Talk:Goddyn's conjecture on thin spanning trees‏‎ (2 revisions)
11. Linking property‏‎ (2 revisions)
12. Quasi-kernels and quasi-sinks‏‎ (2 revisions)
13. DE graph‏‎ (2 revisions)
14. Help:Books‏‎ (2 revisions)
15. Rigidity matrix‏‎ (2 revisions)
16. Talk:Decomposition into forests and a bounded-degree subgraph‏‎ (2 revisions)
17. Convex node set‏‎ (2 revisions)
18. Sparsifier subgraphs‏‎ (2 revisions)
19. Packing capacity disjoint m-arborescences‏‎ (2 revisions - redirect page)
20. Changing conservative weightings in bipartite graphs‏‎ (2 revisions)
21. Weighted bipartite edge colouring‏‎ (2 revisions)
22. Element-connectivity‏‎ (2 revisions)
23. Finding popular matchings‏‎ (2 revisions - redirect page)
24. Talk:Maximizing a skew-supermodular function‏‎ (2 revisions)
25. Stable Matchings‏‎ (2 revisions - redirect page)
26. Deciding the validity of the score sequence of a soccer tournament‏‎ (2 revisions)
27. Rotor-routing halting problem‏‎ (2 revisions)
28. Talk:Edge-disjoint spanning trees and paths‏‎ (2 revisions)
29. Problem of the month May 2011‏‎ (2 revisions)
30. Red-blue cut problem‏‎ (2 revisions)
31. Strongly minimal edge cover‏‎ (2 revisions)
32. Blog:Experiment/2015-08-06‏‎ (2 revisions)
33. Orientation-compatible w-vertex cover‏‎ (2 revisions)
34. Talk:Red-blue cut problem‏‎ (2 revisions)
35. Partition median problem‏‎ (2 revisions)
36. Talk:Bounded degree matroid basis‏‎ (2 revisions)
37. Talk:Finding the largest popular matching in a bipartite graph‏‎ (2 revisions)
38. Gallai-Roy theorem‏‎ (3 revisions)
39. Conforti-Cornuéjols conjecture on the MFMC property‏‎ (3 revisions)
40. Edmonds' disjoint arborescences theorem‏‎ (3 revisions)
41. Strong colouring of matroid-graph pairs‏‎ (3 revisions)
42. Galvin's bipartite list-edge-colouring theorem‏‎ (3 revisions)
43. Scrambled Rota conjecture‏‎ (3 revisions)
44. Supermodular colouring theorem‏‎ (3 revisions)
45. Integer decomposition of smooth polytopes‏‎ (3 revisions)
46. Talk:Characterization of graphs having a k-connected orientation‏‎ (3 revisions)
47. Extreme direction Sperner for square 0-1 matrix‏‎ (3 revisions)
48. Gammoid‏‎ (3 revisions)
49. Base polyhedron‏‎ (3 revisions)
50. Supermodular function‏‎ (3 revisions)

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)