An extremal problem for subdivisions ofK?5
From MaRDI portal
Recommendations
Cited in
(18)- \(3n-5\) edges do force a subdivision of \(K_5\)
- Topological minors in graphs of large girth
- \(K_{5}(7,3) \leqslant 100\).
- Regular subdivision in \(\mathbb{Z} [\frac{1+\sqrt{5}}{2}]\)
- Subdivisions of a large clique in \(C_6\)-free graphs
- Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\)
- Do 3n − 5 edges force a subdivision ofK5?
- On a conjecture concerning the Petersen graph. II
- scientific article; zbMATH DE number 2147467 (Why is no real title available?)
- K5-Subdivisions in Graphs
- Crux and Long Cycles in Graphs
- Rainbow clique subdivisions
- Balanced Subdivisions of a Large Clique in Graphs with High Average Degree
- Crux, space constraints and subdivisions
- Extremal density for subdivisions with length or sparsity constraints
- Crux, space constraints and subdivisions (extended abstract)
- Embedding clique subdivisions via crux
- What is on his mind?
This page was built for publication: An extremal problem for subdivisions ofK?5
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4238041)