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