Affiliation:
1. Department of Mathematics Taiyuan University of Technology Taiyuan People's Republic of China
2. Department of Mathematics Jiangsu University Zhenjiang Jiangsu People's Republic of China
Abstract
AbstractLet and let be an ‐chromatic graph with a color‐critical edge, that is, there exists such that has chromatic number . Gerbner recently conjectured that every ‐vertex maximal ‐free graph with at least edges contains an induced complete ‐partite graph on vertices. Let be a graph obtained from copies of by sharing a common edge. In this paper, we show that for all if is an ‐vertex maximal ‐free graph with at least edges, then contains an induced complete bipartite graph on vertices. We also construct graphs to show that the magnitude in is best possible, which disproves Gerbner's conjecture for .
Subject
Geometry and Topology,Discrete Mathematics and Combinatorics
Reference9 articles.
1. P.Erdős Some recent results on extremal problems in graph theory (Results) Theory Graphs(Internl. Symp. Rome) 1966 pp.118–123.
2. On maximal paths and circuits of graphs
3. A Note on Stability for Maximal F-Free Graphs
4. A stability theorem for maximal K r+1 -free graphs