# Newest pages

**This page lists the 50 newest pages on the wiki.**

Show up to 10 | 20 | 30 | 50 | 100 | 150 pages

Hide redirect pages

Listing 50 newest pages:

- Acyclic orientation with connectivity presciptions
- Weighted bipartite edge colouring
- Strongly maximal matchings and covers
- Strongly minimal edge cover
- Strongly maximal matchings, strongly minimal vertex covers
- Orientation conjecture of Nash-Williams
- Infinite combinatorics
- Infinite Lucchesi-Younger
- Category:Infinite combinatorics
- Quasi-kernels and quasi-sinks
- Strongly maximal H-free spanning subgraph
- Seymour's self-minor conjecture
- Fishbone conjecture
- Compactness of Kőnig-property
- Complexity of computing the rotor-router action
- Category:Chip-firing
- Complexity of computing a v-reduced divisor in multigraphs
- Reduced graph divisors
- Upper bound on the divisorial gonality of a graph
- Divisorial gonality of a graph
- Riemann-Roch-theorem of Baker and Norine
- Duality between chip-firing games and graph divisor theory
- Edge-covering number of 2-polymatroids
- Picard group of a graph
- Rank of graph divisors
- Linear equivalence of graph divisors
- Complexity of the chip-firing reachability problem for general digraphs
- Complexity of the halting problem for Eulerian multigraphs
- Complexity of the halting problem for simple digraphs
- Abelian property of the chip-firing game
- Chip-firing
- Kundu-Lawler theorem
- Mendelsohn-Dulmage theorem
- Linking property
- Sands-Sauer-Woodrow theorem
- Blog posts
- Category:Blog posts
- Blog:Tidbits/Generalized Nash Equilibrium
- Hoffman-Kruskal theorem
- Matroid kernel
- Sparsifier subgraphs
- Serial symmetric exchanges
- Blog talk:Tidbits/Bonn, matroids, and Farkas’ Lemma
- Blog talk:Tidbits/Kernel-perfectness
- Blog:Tidbits/Bonn, matroids, and Farkas’ Lemma
- Talk:Head-disjoint strongly connected orientations
- Olson's theorem
- Min-sum two edge-disjoint paths
- Deciding the existence of popular matchings
- Talk:Finding popular matchings