Induced subdivisions in K_s,s-free graphs with polynomial average degree

DOI10.1093/IMRN/RNAF025MaRDI QIDQ6919484zbMATH OpenFDO

Authors António Girão, Zach Hunter

Publication date 8 October 2025

Published in IMRN. International Mathematics Research Notices (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1093/IMRN/RNAF025

zbMATH Keywords

\(\chi\)-boundednesssubstructures in graphs of high chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• \(\chi\)-bounds, operations, and chords
• A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number
• A solution to Erdős and Hajnal’s odd cycle problem
• A survey of -boundedness
• Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs
• Dense induced bipartite subgraphs in triangle-free graphs
• Dense Induced Subgraphs of Dense Bipartite Graphs
• Disjoint isomorphic balanced clique subdivisions
• Every graph of sufficiently large average degree contains a C₄-free subgraph of large average degree
• Extremal numbers of cycles revisited
• scientific article; zbMATH DE number 3747156 (Why is no real title available?)
• scientific article; zbMATH DE number 3480625 (Why is no real title available?)
• scientific article; zbMATH DE number 4183452 (Why is no real title available?)
• Induced subdivisions in \(K_{s,s}\)-free graphs with polynomial average degree
• Induced subgraphs of graphs with large chromatic number. III: Long holes
• Induced subgraphs of graphs with large chromatic number. VI. Banana trees
• Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes
• Induced subgraphs of graphs with large chromatic number. X. Holes of specific residue
• Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree
• Polynomial bounds for chromatic number. IV: A near-polynomial bound for excluding the five-vertex path
• Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
• Radius two trees specify χ‐bounded classes
• Resolution of the Erdős–Sauer problem on regular subgraphs
• Topological cliques in graphs II
• Triangle-free intersection graphs of line segments with large chromatic number

Cited in

(3)

• Counting independent sets in structured graphs
• Induced subdivisions in \(K_{s,s}\)-free graphs with polynomial average degree
• Combinatorics. Abstracts from the workshop held January 4--9, 2026

This page was built for publication: Induced subdivisions in \(K_{s,s}\)-free graphs with polynomial average degree

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