On the Bollobás–Eldridge Conjecture for Bipartite Graphs
From MaRDI portal
Publication:5443799
DOI10.1017/S0963548307008395zbMath1136.05029OpenAlexW2064884497WikidataQ122942537 ScholiaQ122942537MaRDI QIDQ5443799
No author found.
Publication date: 22 February 2008
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548307008395
Related Items (14)
Packing two graphs of even girth 10 ⋮ A survey on Hamilton cycles in directed graphs ⋮ On Degree Sequences Forcing The Square of a Hamilton Cycle ⋮ A Dirac-Type Result on Hamilton Cycles in Oriented Graphs ⋮ A rainbow blow‐up lemma ⋮ Packing a number of copies of a \(( p , q )\)-graph ⋮ A rainbow blow-up lemma for almost optimally bounded edge-colourings ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ A blow-up lemma for approximate decompositions ⋮ On embedding well-separable graphs ⋮ On the relation of separability, bandwidth and embedding ⋮ Packing Graphs of Bounded Codegree ⋮ A hypergraph blow-up lemma ⋮ Embedding Graphs Having Ore-Degree at Most Five
Cites Work
- Edge disjoint placement of graphs
- An \(\Omega{} (n^{4/3})\) lower bound on the randomized complexity of graph properties
- On packing bipartite graphs
- Packings of graphs and applications to computational complexity
- Combinatorics, Paul Erdős is eighty. Vol. 1
- Blow-up lemma
- Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three
- 2-factors in dense graphs
- Embedding Arbitrary Graphs of Maximum Degree Two
- Probability Inequalities for Sums of Bounded Random Variables
- On the maximal number of independent circuits in a graph
This page was built for publication: On the Bollobás–Eldridge Conjecture for Bipartite Graphs
