List of redirects
Showing below up to 50 results in range #1 to #50.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- Acyclic orientation with connectivity presciptions → Acyclic orientation with connectivity prescriptions
- Bounded minimum weight fractional matching → Maximum weight bounded fractional matching
- Branching → Arborescence
- Clutters with the MFMC property → Conforti-Cornuéjols conjecture on the MFMC property
- Determining the Fries number of a graph → Maximum size of a source-sink reorientable set
- Dijoins → Dijoin
- Directed hypergraphs → Directed hypergraph
- Disjoint A-paths → Disjoint S-paths
- Disjoint Steiner-trees → Kriesell's conjecture
- Dumpy graphs → Dumpy graph
- Existence of strongly stable flow → Existence of completely stable flow
- Finding popular matchings → Deciding the existence of popular matchings
- G-polymatroid → Generalized polymatroid
- Generical rigidity in three dimensions → Generic rigidity in three dimensions
- In-degree bounded arborescences → In-degree bounded directed forests
- Kalai's conjecture → Making the union of two directed spanning trees strongly connected
- Kundu-Lawler theorem → Mendelsohn-Dulmage theorem
- Matroid parity → Matroid matching
- Open problem list → List of open problems
- Packing capacity disjoint k-arborescences → Capacitated packing of k-arborescences
- Packing capacity disjoint m-arborescences → Capacitated packing of k-arborescences
- Problem of the month → Problem of the season
- Problem of the season → Problem of the season 2014/2
- Problem of the season 2012/2 → List colouring of two matroids
- Problem of the season 2012/3 → Partitioning a bipartite graph into proportional factors
- Problem of the season 2013/1 → Disjoint strongly connected spanning subgraphs
- Problem of the season 2014/1 → Maximum size of a source-sink reorientable set
- Problem of the season 2014/2 → Highly element-connected orientation
- Smoothness of matroids → Equitability of matroids
- Source-stable set → Sink-stable set
- Stable Matchings → Stable matchings and kernels
- Stable matchings → Stable matchings and kernels
- Strong colouring of matroids → Strong colouring of matroid-graph pairs
- Strongly maximal matchings, strongly minimal vertex covers → Strongly maximal matchings
- Strongly maximal matchings and covers → Strongly maximal matchings, strongly minimal vertex covers
- Strongly t-perfect graphs → Are t-perfect graphs strongly t-perfect?
- The Aharoni-Berger conjecture → Aharoni-Berger conjecture
- Transversal matroid → Gammoid
- Talk:Finding popular matchings → Talk:Finding the largest popular matching in a bipartite graph
- Talk:Smoothness of matroids → Talk:Equitability of matroids
- Category:Blog posts → Blog posts
- Category:Chip-firing → Chip-firing
- Category:Colouring → Colouring
- Category:Cycles and paths → Cycles and paths
- Category:Edge-connectivity → Edge-connectivity
- Category:Infinite combinatorics → Infinite combinatorics
- Category:Integer polyhedra → Integer polyhedra
- Category:Matchings → Matchings
- Category:Matrices with indeterminates → Matrices with indeterminates
- Category:Matroids → Matroids
