pith. machine review for the scientific record. sign in

arxiv: 1001.2070 · v1 · submitted 2010-01-13 · 🧮 math.CO

Recognition: unknown

Chromatic number and mimimum degree of K_r-free graphs

Vladimir Nikiforov
Authors on Pith no claims yet
classification 🧮 math.CO
keywords graphsnumberchromaticdegreeresultsdetermineextendedfamous
0
0 comments X
read the original abstract

A number of famous results about triangle-free graphs determine the maximum chromatic number of graphs of order n with minimum degree greater than n/3. In this note these results are extended to Kr-free graphs.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. On the chromatic profile for tripartite graphs and beyond

    math.CO 2026-04 unverdicted novelty 8.0

    For all H with χ(H)=3, δ_χ(H,2) belongs to the finite set {1/2, 2/5, 2/7, 1/4, 2/9, 1/5, 2/11, 1/6}, with complete structural characterization of the associated H and an extension to color-critical graphs via the new ...

  2. Chromatic thresholds for pairs of graphs

    math.CO 2026-05 unverdicted novelty 7.0

    For pairs of 3-chromatic graphs H1 and H2, the two-color Ramsey chromatic threshold is exactly one of 2/3, 5/7, 3/4, 7/9, or 4/5, determined by the individual chromatic thresholds and embeddability into C5-type Ramsey...