Inverting the Turán problem with chromatic number

DOI10.1016/J.DISC.2021.112517MaRDI QIDQ2037594zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Inverting the Turán problem
• Rainbow Turán Problems
• Inverse Turán numbers
• scientific article; zbMATH DE number 3251276
• Chromatic Turán problems and a new upper bound for the Turán density of \(\mathcal K^{-}_{4}\)

Cites work

• Bipartite subgraphs
• Bipartite subgraphs of integer weighted graphs
• Extremal \(C_{4}\)-free/\(C_{5}\)-free planar graphs
• scientific article; zbMATH DE number 3262986 (Why is no real title available?)
• scientific article; zbMATH DE number 3285073 (Why is no real title available?)
• scientific article; zbMATH DE number 3043302 (Why is no real title available?)
• Inverse Turán numbers
• Inverting the Turán problem
• Large subgraphs without short cycles
• Large triangle-free subgraphs in graphs without \(K_ 4\)
• Maximal circuits of graphs. I
• On maximal paths and circuits of graphs
• On the structure of linear graphs
• Star forests, dominating sets and Ramsey-type problems

Cited in

(4)

• Inverting the Turán problem
• Inverse chromatic number problems in interval and permutation graphs
• Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs
• LARGE -FREE SUBGRAPHS IN -CHROMATIC GRAPHS

This page was built for publication: Inverting the Turán problem with chromatic number

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