DeepAI AI Chat
Log In Sign Up

Sharp bounds for the chromatic number of random Kneser graphs

by   Sergei Kiselev, et al.

Given positive integers n> 2k, a Kneser graph KG_n,k is a graph whose vertex set is the collection of all k-element subsets of the set {1,..., n}, with edges connecting pairs of disjoint sets. One of the classical results in combinatorics, conjectured by M. Kneser and proved by L. Lovász, states that the chromatic number of KG_n,k is equal to n-2k+2. In this paper, we study the random Kneser graph KG_n,k(p), that is, the graph obtained from KG_n,k by including each of the edges of KG_n,k independently and with probability p. We prove that, for any fixed k> 3, χ(KG_n,k(1/2)) = n-Θ(√(_2 n)) and, for k=2, χ(KG_n,k(1/2)) = n-Θ(√(_2 n ·_2_2 n)). We also prove that, for any fixed l> 6 and k> C√( n), we have χ(KG_n,k(1/2))> n-2k+2-2l, where C=C(l) is an absolute constant. This significantly improves previous results on the subject, obtained by Kupavskii and by Alishahi and Hajiabolhassan. We also discuss an interesting connection to an extremal problem on embeddability of complexes.


page 1

page 2

page 3

page 4


Reducing graph transversals via edge contractions

For a graph parameter π, the Contraction(π) problem consists in, given a...

The graph tessellation cover number: extremal bounds, efficient algorithms and hardness

A tessellation of a graph is a partition of its vertices into vertex dis...

Improved Bounds for Guarding Plane Graphs with Edges

An "edge guard set" of a plane graph G is a subset Γ of edges of G such ...

Sparse Kneser graphs are Hamiltonian

For integers k≥ 1 and n≥ 2k+1, the Kneser graph K(n,k) is the graph whos...

The Lovász Local Lemma is Not About Probability

Given a collection of independent events each of which has strictly posi...

Greedy Heuristics and Linear Relaxations for the Random Hitting Set Problem

Consider the Hitting Set problem where, for a given universe 𝒳 = { 1, .....

Sharp Thresholds in Adaptive Random Graph Processes

Suppose that K_n is the complete graph on vertex set [n], and is a dist...