Subdivision thresholds for two classes of graphs

DOI10.1016/0012-365X(94)90140-6MaRDI QIDQ1322242zbMATH OpenOpenAlexFDO

Authors A. J. Depew, Curtiss Barefoot, Lane Clark, R. C. Entringer, László A. Székely

Publication date 5 May 1994

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(94)90140-6

zbMATH Keywords

extremal graphssubdivision threshold

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• The extremal number of longer subdivisions
• The extremal number of the subdivisions of the complete bipartite graph
• Turán numbers of subdivided graphs
• Subdivisions of graphs: A generalization of paths and cycles
• Some probabilistic and extremal results on subdivisions and odd subdivisions of graphs

Cited in

(5)

• Repetition thresholds for subdivided graphs and trees
• Some probabilistic and extremal results on subdivisions and odd subdivisions of graphs
• Local conditions for exponentially many subdivisions
• Combinatorial Geometry and Graph Theory
• Saturation of K₄ subdivisions in multidimensional grids

This page was built for publication: Subdivision thresholds for two classes of graphs

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