Newest pages

Jump to: navigation, search

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:

  1. Edge-independent spanning trees
  2. Acyclic orientation with connectivity presciptions
  3. Weighted bipartite edge colouring
  4. Strongly maximal matchings and covers
  5. Strongly minimal edge cover
  6. Strongly maximal matchings, strongly minimal vertex covers
  7. Orientation conjecture of Nash-Williams
  8. Infinite combinatorics
  9. Infinite Lucchesi-Younger
  10. Category:Infinite combinatorics
  11. Quasi-kernels and quasi-sinks
  12. Strongly maximal H-free spanning subgraph
  13. Seymour's self-minor conjecture
  14. Fishbone conjecture
  15. Compactness of Kőnig-property
  16. Complexity of computing the rotor-router action
  17. Category:Chip-firing
  18. Complexity of computing a v-reduced divisor in multigraphs
  19. Reduced graph divisors
  20. Upper bound on the divisorial gonality of a graph
  21. Divisorial gonality of a graph
  22. Riemann-Roch-theorem of Baker and Norine
  23. Duality between chip-firing games and graph divisor theory
  24. Edge-covering number of 2-polymatroids
  25. Picard group of a graph
  26. Rank of graph divisors
  27. Linear equivalence of graph divisors
  28. Complexity of the chip-firing reachability problem for general digraphs
  29. Complexity of the halting problem for Eulerian multigraphs
  30. Complexity of the halting problem for simple digraphs
  31. Abelian property of the chip-firing game
  32. Chip-firing
  33. Kundu-Lawler theorem
  34. Mendelsohn-Dulmage theorem
  35. Linking property
  36. Sands-Sauer-Woodrow theorem
  37. Blog posts
  38. Category:Blog posts
  39. Blog:Tidbits/Generalized Nash Equilibrium
  40. Hoffman-Kruskal theorem
  41. Matroid kernel
  42. Sparsifier subgraphs
  43. Serial symmetric exchanges
  44. Blog talk:Tidbits/Bonn, matroids, and Farkas’ Lemma
  45. Blog talk:Tidbits/Kernel-perfectness
  46. Blog:Tidbits/Bonn, matroids, and Farkas’ Lemma
  47. Talk:Head-disjoint strongly connected orientations
  48. Olson's theorem
  49. Min-sum two edge-disjoint paths
  50. Deciding the existence of popular matchings