On embedding well-separable graphs

DOI10.1016/j.disc.2007.08.015zbMath1157.05032arXiv0707.2522OpenAlexW2009873575MaRDI QIDQ941369

Béla Csaba

Publication date: 4 September 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0707.2522

zbMATH Keywords

subgraphextremal graph theorywell-separable

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (4)

Bounded-Degree Spanning Trees in Randomly Perturbed Graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Embedding Spanning Bipartite Graphs of Small Bandwidth ⋮ On the relation of separability, bandwidth and embedding

Cites Work

• Almost \(H\)-factors in dense graphs
• Blow-up lemma
• \(H\)-factors in dense graphs
• Spanning Trees in Dense Graphs
• An algorithmic version of the blow-up lemma
• The Blow-up Lemma
• Proof of a Packing Conjecture of Bollobás
• On the Bollobás–Eldridge Conjecture for Bipartite Graphs
• On the structure of linear graphs
• Proof of the Alon-Yuster conjecture
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On embedding well-separable graphs