The following pages link to Eli Berger (Q186190):
Displaying 50 items.
- Two disjoint independent bases in matroid-graph pairs (Q497297) (← links)
- On rainbow matchings in bipartite graphs (Q510529) (← links)
- The Max-Flow Min-Cut theorem for countable networks (Q618031) (← links)
- Eulerian edge sets in locally finite graphs (Q653982) (← links)
- The edge covering number of the intersection of two matroids (Q658021) (← links)
- The Grothendieck constant of random and pseudo-random graphs (Q951106) (← links)
- Independence-domination duality (Q958688) (← links)
- Strongly maximal matchings in infinite graphs (Q1010872) (← links)
- Menger's theorem for infinite graphs (Q1016232) (← links)
- On the Erdős-Hajnal conjecture for six-vertex tournaments (Q1621068) (← links)
- A condition for assured 3-face-colorability of infinite plane graphs with a given spanning tree (Q1660283) (← links)
- On a conjecture of Stein (Q1688259) (← links)
- Fair representation in dimatroids (Q1689871) (← links)
- Unfriendly partitions for graphs not containing a subdivison of an infinite cycle (Q1705811) (← links)
- Dynamic monopolies of constant size (Q1850560) (← links)
- A tree version of Kőnig's theorem (Q1872889) (← links)
- Tournaments and colouring (Q1932469) (← links)
- Finding an induced path that is not a shortest path (Q2032716) (← links)
- Tournaments and the strong Erdős-Hajnal property (Q2065123) (← links)
- Rainbow paths and large rainbow matchings (Q2073301) (← links)
- Strongly maximal antichains in posets (Q2275382) (← links)
- Cooperative colorings of trees and of bipartite graphs (Q2294110) (← links)
- Forcing large transitive subtournaments (Q2343283) (← links)
- Cliques in the union of graphs (Q2349513) (← links)
- Rainbow matchings in \(r\)-partite \(r\)-graphs (Q2380283) (← links)
- Fair representation in the intersection of two matroids (Q2409842) (← links)
- Topological methods for the existence of a rainbow matching (Q2413401) (← links)
- Cliques in the union of \(C_4\)-free graphs (Q2413627) (← links)
- Treewidth of grid subsets (Q2416442) (← links)
- Large rainbow matchings in general graphs (Q2422240) (← links)
- A note on the edge cover number and independence number in hypergraphs (Q2427533) (← links)
- Kernels in weighted digraphs (Q2454043) (← links)
- Independent systems of representatives in weighted graphs (Q2460628) (← links)
- Proof of Berge's strong path partition conjecture for \(k=2\) (Q2462329) (← links)
- KKM -- a topological approach for trees (Q2567406) (← links)
- Eigenvalues and homology of flag complexes and vector representations of graphs (Q2571734) (← links)
- Eigenvalues of K1,k-Free Graphs and the Connectivity of Their Independence Complexes (Q2833255) (← links)
- The intersection of a matroid and a simplicial complex (Q3420348) (← links)
- Acyclic systems of representatives and acyclic colorings of digraphs (Q3605147) (← links)
- Degree Conditions for Matchability in 3‐Partite Hypergraphs (Q4604015) (← links)
- Fair Representation by Independent Sets (Q4604368) (← links)
- A unified approach to known and unknown cases of Berge's conjecture (Q4650184) (← links)
- Correct Hardware Design and Verification Methods (Q5897062) (← links)
- The number of edges in critical strongly connected graphs (Q5936056) (← links)
- Nonuniform Degrees and Rainbow Versions of the Caccetta–Häggkvist Conjecture (Q6171263) (← links)
- Almost fair perfect matchings in complete bipartite graphs (Q6197733) (← links)
- Bounded diameter tree-decompositions (Q6510712) (← links)
- Bounded-diameter tree-decompositions (Q6548028) (← links)
- Looms (Q6611732) (← links)
- Graphs with no even holes and no sector wheels are the union of two chordal graphs (Q6612305) (← links)
