On polynomial degree-boundedness

DOI10.19086/AIC.2024.5MaRDI QIDQ6989707zbMATH OpenFDO

Authors Romain Bourneuf, Matija Bucić, Linda Cook, James E. Davies

Publication date 29 April 2025

Published in Advances in Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.19086/AIC.2024.5

zbMATH Keywords

\(\chi\)-boundednessextremal graph theoryforbidden induced subgraphgraph coloringinduced Kővári-Sós-Turán theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Cited in

(5)

• Counting independent sets in structured graphs
• Induced C₄-free subgraphs with large average degree
• Kővári-Sós-Turán theorem for hereditary families
• Combinatorics. Abstracts from the workshop held January 4--9, 2026
• On geometric bipartite graphs with asymptotically smallest Zarankiewicz numbers

This page was built for publication: On polynomial degree-boundedness

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