Pages with the most revisions

Jump to: navigation, search

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

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

  1. Chip-firing‏‎ (89 revisions)
  2. Edge-connectivity‏‎ (52 revisions)
  3. Sandbox‏‎ (49 revisions)
  4. Main Page‏‎ (41 revisions)
  5. Packing common bases‏‎ (39 revisions)
  6. Sub- and supermodular functions‏‎ (37 revisions)
  7. Kriesell's conjecture‏‎ (29 revisions)
  8. Help:Contents‏‎ (27 revisions)
  9. Matrices with indeterminates‏‎ (27 revisions)
  10. Woodall's conjecture‏‎ (26 revisions)
  11. Integer polyhedra‏‎ (26 revisions)
  12. Stable matchings and kernels‏‎ (24 revisions)
  13. Trees and branchings‏‎ (23 revisions)
  14. Rank of graph divisors‏‎ (23 revisions)
  15. Orientations‏‎ (22 revisions)
  16. List colouring of two matroids‏‎ (22 revisions)
  17. Acyclic orientation with parity constraints‏‎ (21 revisions)
  18. Matroids‏‎ (21 revisions)
  19. Independent arborescences in acyclic digraphs‏‎ (19 revisions)
  20. Problem of the season‏‎ (19 revisions - redirect page)
  21. Riemann-Roch-theorem of Baker and Norine‏‎ (18 revisions)
  22. Maximum square-free 2-matching‏‎ (18 revisions)
  23. Linear equivalence of graph divisors‏‎ (18 revisions)
  24. Compactness of Kőnig-property‏‎ (17 revisions)
  25. Characterization of graphs having a k-connected orientation‏‎ (16 revisions)
  26. Smooth well-balanced orientations with prescribed in-degrees‏‎ (16 revisions)
  27. Rigidity‏‎ (16 revisions)
  28. Finding kernels in special digraphs‏‎ (15 revisions)
  29. Independent trees‏‎ (15 revisions)
  30. Generic rigidity in three dimensions‏‎ (14 revisions)
  31. Berge's conjecture on path partitions‏‎ (14 revisions)
  32. Acyclic orientation with connectivity prescriptions‏‎ (14 revisions)
  33. Reduced graph divisors‏‎ (14 revisions)
  34. Finding the largest popular matching in a bipartite graph‏‎ (14 revisions)
  35. Goddyn's conjecture on thin spanning trees‏‎ (13 revisions)
  36. Exact matching in red-blue bipartite graphs‏‎ (12 revisions)
  37. Partitionability to a tree and a spanning tree‏‎ (12 revisions)
  38. Rigid graph‏‎ (12 revisions)
  39. Maximum size of a source-sink reorientable set‏‎ (12 revisions)
  40. Polymatroid function‏‎ (12 revisions)
  41. Sink-stable set‏‎ (12 revisions)
  42. Complexity of the halting problem for simple digraphs‏‎ (12 revisions)
  43. Minimum polychromatic number for plane graphs with fixed girth‏‎ (12 revisions)
  44. Decomposition into forests and a bounded-degree subgraph‏‎ (12 revisions)
  45. Skew-supermodular colouring with prescribed class-sizes‏‎ (12 revisions)
  46. Stable matching‏‎ (12 revisions)
  47. Union of a spanning arborescence and a directed spanning tree‏‎ (12 revisions)
  48. Capacitated packing of k-arborescences‏‎ (11 revisions)
  49. Duality between chip-firing games and graph divisor theory‏‎ (11 revisions)
  50. Equitability of matroids‏‎ (11 revisions)

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