Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

A Note on \(K_{r}\)-Free Graphs with Chromatic Number at least \(r\)

Michael E. Picollelli1
1Department of Mathematics California State University San Marcos San Marcos, CA 92096, USA
  • Published: 29/02/2016

Abstract

We provide a new proof of a result of Hanson and Toft classifying the maximum-size \(K_r\)-free graphs on \(n\) vertices with chromatic number at least \(r\).

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Michael E. Picollelli. A Note on \(K_{r}\)-Free Graphs with Chromatic Number at least \(r\)[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 096. 217-222. .