"Application of an Extremal Result of Erdős and Gallai to the (n,k,t) Problem" by Matt Noble, Peter Johnson et al.
  •  
  •  
 

Publication Date

2017

Abstract

An extremal result about vertex covers, attributed by Hajnal to Erdős and Gallai, is applied to prove the following: If n, k, and t are integers satisfying nkt ≥ 3 and k ≤ 2t - 2, and G is a graph with the minimum number of edges among graphs on n vertices with the property that every induced subgraph on k vertices contains a complete subgraph on t vertices, then every component of G is complete.

Creative Commons License

Creative Commons Attribution 4.0 License
This work is licensed under a Creative Commons Attribution 4.0 License.

tag_2017_4_2_1_reflist.pdf (87 kB)
Supplemental file with DOI

Plum Print visual indicator of research metrics
PlumX Metrics
  • Usage
    • Downloads: 247
    • Abstract Views: 171
  • Captures
    • Readers: 1
see details

Share

COinS