On the minimal degree condition of graphs implying equality of the largest \(K_r\)-free subgraphs and \((r - 1)\)-partite subgraphs

DOI10.1016/j.disc.2021.112453zbMath1466.05037OpenAlexW3164672787MaRDI QIDQ2032881

Chengfei Xie, Bingchen Qian, Gennian Ge

Publication date: 14 June 2021

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

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

zbMATH Keywords

minimal degree\(r\)-partite subgraph\( K_r\)-free subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Density conditions for triangles in multipartite graphs
• On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• ODD Cycles of Specified Length in Non-Bipartite Graphs
• Triangle-Free Graphs with High Minimal Degrees
• Extremal subgraphs of random graphs

This page was built for publication: On the minimal degree condition of graphs implying equality of the largest \(K_r\)-free subgraphs and \((r - 1)\)-partite subgraphs