Inverting the Turán problem with chromatic number

DOI10.1016/j.disc.2021.112517zbMath1467.05127OpenAlexW3174162208MaRDI QIDQ2037594

Xiutao Zhu, Yaojun Chen

Publication date: 8 July 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2021.112517

zbMATH Keywords

chromatic numberextremal graphTurán problem

Mathematics Subject Classification ID

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

Related Items

LARGE -FREE SUBGRAPHS IN -CHROMATIC GRAPHS

Cites Work

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