Subdivisions of K_{r+2} in Graphs of Average Degree at Least r+\varepsilon and Large but Constant Girth

DOI10.1017/S0963548304006169MaRDI QIDQ4819248zbMATH OpenOpenAlexFDO

Authors Daniela Kühn, Deryk Osthus

Publication date 24 September 2004

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548304006169

zbMATH Keywords

average degreecomplete graphgirthsubdivision

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph minors (05C83)

Recommendations

• Subdivisions of a graph of maximal degree n+1 in graphs of average degree n+ and large girth
• Topological minors in graphs of large girth
• Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree
• Improved Bounds for Topological Cliques in Graphs of Large Girth
• Every graph of sufficiently large average degree contains a C₄-free subgraph of large average degree

Cited in

(8)

• Subdivisions of graphs with large minimum degree
• Some probabilistic and extremal results on subdivisions and odd subdivisions of graphs
• Subdivisions of a graph of maximal degree n+1 in graphs of average degree n+ and large girth
• Disjoint isomorphic balanced clique subdivisions
• Balanced Subdivisions of a Large Clique in Graphs with High Average Degree
• Small subgraphs with large average degree
• Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree
• Girth and treewidth

This page was built for publication: Subdivisions of $K_{r+2}$ in Graphs of Average Degree at Least $r+\varepsilon$ and Large but Constant Girth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4819248)