All pages
| All pages |
- Abelian property of the chip-firing game
- Achieve global rigidity by pinning nodes
- Acyclic orientation with connectivity presciptions
- Acyclic orientation with connectivity prescriptions
- Acyclic orientation with parity constraints
- Aharoni-Berger conjecture
- All categories
- Arborescence
- Arboricity
- Are t-perfect graphs strongly t-perfect?
- Are there deletion-contraction formulas for the polymatroid Tutte polynomial?
- Base orderable matroid
- Base polyhedron
- Berge's conjecture on path partitions
- Bi-set
- Binary matroid representation of cyclic families
- Blog posts
- Bounded degree matroid basis
- Bounded minimum weight fractional matching
- Braid and bundle
- Branching
- Caccetta-Häggkvist conjecture
- Capacitated packing of k-arborescences
- Capacity-obeying packing
- Carathéodory rank
- Changing conservative weightings in bipartite graphs
- Characterization of dual-critical graphs
- Characterization of graphs having a k-connected orientation
- Characterizing integral g-polymatroids
- Chip-firing
- Chromatic number
- Chromatic number of t-perfect graphs
- Clutter
- Clutters with the MFMC property
- Colouring
- Compactness of Kőnig-property
- Compatible Euler-tours
- Complexity of computing a v-reduced divisor in multigraphs
- Complexity of computing the rotor-router action
- 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
- Conforti-Cornuéjols conjecture on the MFMC property
- Conservative weighting
- Constructive characterization of dumpy graphs
- Convex node set
- Count matroid
- Covering a crossing supermodular function with graph edges
- Covering a crossing supermodular function with pairwise non-parallel arcs
- Covering a symmetric crossing supermodular function with hyperedges of prescribed size
- Covering number
- Cycles and paths
- Cyclic orderings of matroids
- Cyclic stable matchings
- Cyclic stable set
- DE graph
- Deciding kernel-perfectness
- Deciding the existence of popular matchings
- Deciding the validity of the score sequence of a soccer tournament
- Decomposing rooted (k,l)-connected graphs into rooted k-connected parts
- Decomposition into forests and a bounded-degree subgraph
- Decomposition into two trees with orientation constraints
- Decomposition of oriented k-partition-connected digraphs
- Delta-matroid
- Deltoid
- Destroying rigidity
- Determining the Fries number of a graph
- Dijoin
- Dijoins
- Directed hypergraph
- Directed hypergraphs
- Disjoint A-paths
- Disjoint S-paths
- Disjoint Steiner-trees
- Disjoint spanning in- and out-arborescences
- Disjoint strongly connected spanning subgraphs
- Divisorial gonality of a graph
- Duality between chip-firing games and graph divisor theory
- Dumpy graph
- Dumpy graphs
- Edge-connectivity
- Edge-covering number of 2-polymatroids
- Edge-disjoint T-connectors
- Edge-disjoint spanning trees and paths
- Edge-independent spanning trees
- Edmonds' disjoint arborescences theorem
- Edmonds' matching polytope theorem
- Edmonds' matroid intersection theorem
- Edmonds-Giles theorem
- Element-connectivity
- Equitability of matroids
- Equitable list colouring
- Even factor problem
- Exact matching in red-blue bipartite graphs
- Existence of completely stable flow
- Existence of strongly stable flow
- Expressing vectors using bases of a matroid
- Extreme direction Sperner for square 0-1 matrix
- Finding a 2-way stable 3-way exchange
- Finding kernels in special digraphs
- Finding popular matchings
- Finding the largest popular matching in a bipartite graph
- Fishbone conjecture
- Frank-Jordán theorem
- Fujishige's base polyhedron theorem
- G-polymatroid
- Gallai-Roy theorem
- Galvin's bipartite list-edge-colouring theorem
- Gammoid
- Generalized polymatroid
- Generic global rigidity in three dimensions
- Generic rigidity in three dimensions
- Generical rigidity in three dimensions
- Goddyn's conjecture on thin spanning trees
- Gonality and edge subdivisions
- Graphs extendable to a uniquely matchable bipartite graph
- Greene-Kleitman theorem
- Head-disjoint strongly connected orientations
- Highly element-connected orientation
- Hoffman's circulation theorem
- Hoffman-Kruskal theorem
- Hypergraphic matroid
- In-degree bounded arborescences
- In-degree bounded directed forests
- Incomplete splitting-off in digraphs
- Independent arborescences in acyclic digraphs
- Independent trees
- Infinite Lucchesi-Younger
- Infinite combinatorics
- Integer decomposition of smooth polytopes
- Integer decomposition property
- Integer polyhedra
- Integer polyhedron
- Kalai's conjecture
- Kernel (in digraph)
- Kriesell's conjecture
- Kundu-Lawler theorem
- Laman's theorem
- Lehman's theorem
- Linear equivalence of graph divisors
- Linking property
- List colouring of two matroids
- List of open problems
- Local edge-connectivity
- Local edge-connectivity augmentation of a hypergraph with fixed rank
- Lucchesi-Younger theorem
- Mader's S-paths theorem
- Mader's splitting-off theorem
- Main Page
- Making the union of two directed spanning trees strongly connected
- Matchings
- Matrices with indeterminates
- Matroid kernel
- Matroid matching
- Matroid parity
- Matroid union theorem
- Matroids
- Maximizing a skew-supermodular function
- Maximum average degree
- Maximum size of a source-sink reorientable set
- Maximum square-free 2-matching
- Maximum weakly stable matchings in graphs without odd preference cycles
- Maximum weight bounded fractional matching
- Maximum weight k-element subsets of perfect matchings
- Mendelsohn-Dulmage theorem
- Min-sum two edge-disjoint paths
- Minimum k-way cut in a hypergraph
- Minimum polychromatic number for plane graphs with fixed girth
- Multiway cut
- Nash-Williams' forest cover theorem
- Nash-Williams' strong orientation theorem
- Node-connectivity
- Node disjoint circuits in Eulerian digraphs
- Odd vertex pairing
- Olson's theorem
- Open problem categories
- Open problem list
- Opposite vertices of base polyhedra
- Orientation-compatible w-vertex cover
- Orientation conjecture of Nash-Williams
- Orientation of nonideal clutters
- Orientation with degree bounds
- Orientation with shortest round trip
- Orientations
- Packing capacity disjoint k-arborescences
- Packing capacity disjoint m-arborescences
- Packing common bases
- Parity constrained strongly connected orientations
- Partial vertex cover in bipartite graphs
- Partition connectivity
- Partition median problem
- Partitionability to a tree and a spanning tree
- Partitioning a bipartite graph into proportional factors
- Paving matroid
- Picard group of a graph
- Polyhedral description of kernels
- Polymatroid function
- Problem of the month
- Problem of the month April 2010
- Problem of the month April 2011
- Problem of the month February 2010
- Problem of the month February 2011
- Problem of the month January 2010
- Problem of the month January 2011
- Problem of the month July 2010
- Problem of the month June 2010
- Problem of the month March 2010
- Problem of the month May 2010
- Problem of the month May 2011
- Problem of the season
- Problem of the season 2012/2
- Problem of the season 2012/3
- Problem of the season 2013/1
- Problem of the season 2014/1
- Problem of the season 2014/2
- Quasi-kernels and quasi-sinks
- Rainbow matchings in bipartite graphs
- Rank-respecting augmentation of hypergraphs with negamodular constraints
- Rank of graph divisors
- Recognition of Seymour graphs
- Red-blue cut problem
- Reduced graph divisors
- Richardson's theorem
- Riemann-Roch-theorem of Baker and Norine
- Rigid graph
- Rigidity
- Rigidity matrix
- Rooted connectivity
- Rota's conjecture on disjoint bases
- Rotor-routing halting problem
- S-T edge-connectivity augmentation
- Sabidussi's compatibility conjecture
- Sandbox
- Sandbox2
- Sands-Sauer-Woodrow theorem
- Scrambled Rota conjecture
- Serial symmetric exchanges
- Seymour's self-minor conjecture
- Sink-stable set
- Skew-supermodular colouring with prescribed class-sizes
- Skew-supermodular colouring with two class sizes
- Skew-supermodular list colouring
- Small quasi-kernels in directed graphs
- Small representations of gammoids
- Smooth well-balanced orientations with prescribed in-degrees
- Smoothness of matroids
- Source-stable set
- Sparse graphs
- Sparsifier subgraphs
- Splitting off
- Stable Matchings
- Stable exchange
- Stable flow
- Stable matching
- Stable matchings
- Stable matchings and kernels
- Strong colouring of matroid-graph pairs
- Strong colouring of matroids
- Strongly edge-disjoint arborescences
- Strongly maximal H-free spanning subgraph
- Strongly maximal matchings
- Strongly maximal matchings, strongly minimal vertex covers
- Strongly maximal matchings and covers
- Strongly minimal edge cover
- Strongly t-perfect graphs
- Sub- and supermodular functions
- Submodular function
- Supermodular colouring theorem
- Supermodular function
- Surveys
- T-join
- T-perfect and h-perfect graphs
- The Aharoni-Berger conjecture
- Total dual integrality
- Transversal matroid
- Trees and branchings
- Tutte's disjoint tree theorem
- Undirected node-connectivity augmentation
- Union of a spanning arborescence and a directed spanning tree
- Upper bound on common independent set cover
- Upper bound on the divisorial gonality of a graph
- Weighted bipartite edge colouring
- Well-balanced orientation
- Well-balanced orientations of hypergraphs
- Woodall's conjecture
