Pages with the most revisions
Showing below up to 50 results in range #1 to #50.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- Chip-firing (91 revisions)
- Edge-connectivity (52 revisions)
- Sandbox (49 revisions)
- Main Page (41 revisions)
- Packing common bases (40 revisions)
- Sub- and supermodular functions (37 revisions)
- Kriesell's conjecture (29 revisions)
- Matrices with indeterminates (27 revisions)
- Help:Contents (27 revisions)
- Integer polyhedra (26 revisions)
- Woodall's conjecture (26 revisions)
- Stable matchings and kernels (24 revisions)
- Rank of graph divisors (23 revisions)
- Trees and branchings (23 revisions)
- Orientations (22 revisions)
- List colouring of two matroids (22 revisions)
- Acyclic orientation with parity constraints (21 revisions)
- Matroids (21 revisions)
- Problem of the season (19 revisions - redirect page)
- Independent arborescences in acyclic digraphs (19 revisions)
- Riemann-Roch-theorem of Baker and Norine (18 revisions)
- Maximum square-free 2-matching (18 revisions)
- Linear equivalence of graph divisors (18 revisions)
- Compactness of Kőnig-property (17 revisions)
- Smooth well-balanced orientations with prescribed in-degrees (17 revisions)
- Finding kernels in special digraphs (16 revisions)
- Characterization of graphs having a k-connected orientation (16 revisions)
- Independent trees (16 revisions)
- Rigidity (16 revisions)
- Berge's conjecture on path partitions (14 revisions)
- Acyclic orientation with connectivity prescriptions (14 revisions)
- Generic rigidity in three dimensions (14 revisions)
- Finding the largest popular matching in a bipartite graph (14 revisions)
- Reduced graph divisors (14 revisions)
- Equitability of matroids (13 revisions)
- Goddyn's conjecture on thin spanning trees (13 revisions)
- Sink-stable set (12 revisions)
- Polymatroid function (12 revisions)
- Skew-supermodular colouring with prescribed class-sizes (12 revisions)
- Decomposition into forests and a bounded-degree subgraph (12 revisions)
- Minimum polychromatic number for plane graphs with fixed girth (12 revisions)
- Exact matching in red-blue bipartite graphs (12 revisions)
- Stable matching (12 revisions)
- Complexity of the halting problem for simple digraphs (12 revisions)
- Cyclic orderings of matroids (12 revisions)
- Maximum size of a source-sink reorientable set (12 revisions)
- Partitionability to a tree and a spanning tree (12 revisions)
- Cyclic stable matchings (12 revisions)
- Rigid graph (12 revisions)
- Union of a spanning arborescence and a directed spanning tree (12 revisions)
