List of redirects

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. Acyclic orientation with connectivity presciptions →‎ Acyclic orientation with connectivity prescriptions
  2. Bounded minimum weight fractional matching →‎ Maximum weight bounded fractional matching
  3. Branching →‎ Arborescence
  4. Clutters with the MFMC property →‎ Conforti-Cornuéjols conjecture on the MFMC property
  5. Determining the Fries number of a graph →‎ Maximum size of a source-sink reorientable set
  6. Dijoins →‎ Dijoin
  7. Directed hypergraphs →‎ Directed hypergraph
  8. Disjoint A-paths →‎ Disjoint S-paths
  9. Disjoint Steiner-trees →‎ Kriesell's conjecture
  10. Dumpy graphs →‎ Dumpy graph
  11. Existence of strongly stable flow →‎ Existence of completely stable flow
  12. Finding popular matchings →‎ Deciding the existence of popular matchings
  13. G-polymatroid →‎ Generalized polymatroid
  14. Generical rigidity in three dimensions →‎ Generic rigidity in three dimensions
  15. In-degree bounded arborescences →‎ In-degree bounded directed forests
  16. Kalai's conjecture →‎ Making the union of two directed spanning trees strongly connected
  17. Kundu-Lawler theorem →‎ Mendelsohn-Dulmage theorem
  18. Matroid parity →‎ Matroid matching
  19. Open problem list →‎ List of open problems
  20. Packing capacity disjoint k-arborescences →‎ Capacitated packing of k-arborescences
  21. Packing capacity disjoint m-arborescences →‎ Capacitated packing of k-arborescences
  22. Problem of the month →‎ Problem of the season
  23. Problem of the season →‎ Problem of the season 2014/2
  24. Problem of the season 2012/2 →‎ List colouring of two matroids
  25. Problem of the season 2012/3 →‎ Partitioning a bipartite graph into proportional factors
  26. Problem of the season 2013/1 →‎ Disjoint strongly connected spanning subgraphs
  27. Problem of the season 2014/1 →‎ Maximum size of a source-sink reorientable set
  28. Problem of the season 2014/2 →‎ Highly element-connected orientation
  29. Smoothness of matroids →‎ Equitability of matroids
  30. Source-stable set →‎ Sink-stable set
  31. Stable Matchings →‎ Stable matchings and kernels
  32. Stable matchings →‎ Stable matchings and kernels
  33. Strong colouring of matroids →‎ Strong colouring of matroid-graph pairs
  34. Strongly maximal matchings and covers →‎ Strongly maximal matchings, strongly minimal vertex covers
  35. Strongly t-perfect graphs →‎ Are t-perfect graphs strongly t-perfect?
  36. The Aharoni-Berger conjecture →‎ Aharoni-Berger conjecture
  37. Transversal matroid →‎ Gammoid
  38. Talk:Finding popular matchings →‎ Talk:Finding the largest popular matching in a bipartite graph
  39. Talk:Smoothness of matroids →‎ Talk:Equitability of matroids
  40. Category:Blog posts →‎ Blog posts
  41. Category:Chip-firing →‎ Chip-firing
  42. Category:Colouring →‎ Colouring
  43. Category:Cycles and paths →‎ Cycles and paths
  44. Category:Edge-connectivity →‎ Edge-connectivity
  45. Category:Infinite combinatorics →‎ Infinite combinatorics
  46. Category:Integer polyhedra →‎ Integer polyhedra
  47. Category:Matchings →‎ Matchings
  48. Category:Matrices with indeterminates →‎ Matrices with indeterminates
  49. Category:Matroids →‎ Matroids
  50. Category:Node-connectivity →‎ Node-connectivity

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