Forcing spanning subgraphs via Ore type conditions

DOI10.1016/j.endm.2009.07.042zbMath1273.05046OpenAlexW2172107634MaRDI QIDQ2851473

Julia Böttcher, Sybille Müller

Publication date: 10 October 2013

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

Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.042

zbMATH Keywords

regularity lemmaspanning subgraphsextremal graph theoryore condition

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

On sufficient conditions for spanning structures in dense graphs ⋮ Embedding Spanning Bipartite Graphs of Small Bandwidth

Cites Work

• Unnamed Item
• Spanning 3-colourable subgraphs of small bandwidth in dense graphs
• Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
• Blow-up lemma
• An Ore-type theorem on equitable coloring
• Note on Hamilton Circuits
• On the square of a Hamiltonian cycle in dense graphs

This page was built for publication: Forcing spanning subgraphs via Ore type conditions