LARGE -FREE SUBGRAPHS IN -CHROMATIC GRAPHS

DOI10.1017/s0004972722001319zbMath1525.05087OpenAlexW4311106467MaRDI QIDQ6082048

Zhen He, Zequn Lv, Xiutao Zhu

Publication date: 3 November 2023

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numberconnected graphinverse Turán problem

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Extremal set theory (05D05) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Cites Work

• Large triangle-free subgraphs in graphs without \(K_ 4\)
• Star forests, dominating sets and Ramsey-type problems
• Inverting the Turán problem with chromatic number
• Inverse Turán numbers
• Inverting the Turán problem
• Bipartite subgraphs
• ExtremalC₄-Free/C₅-Free Planar Graphs
• Large Subgraphs without Short Cycles
• On the structure of linear graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: LARGE -FREE SUBGRAPHS IN -CHROMATIC GRAPHS