Cliques in C_4-free graphs of large minimum degree

TL;DR

This paper investigates the structure of large minimum degree $C_4$-free graphs, establishing improved bounds for clique sizes and proving a conjecture about regular graphs, thereby advancing understanding of their combinatorial properties.

Contribution

It provides new bounds on clique sizes in $C_4$-free graphs with large minimum degree and proves a conjecture regarding regular graphs, extending prior results.

Findings

Improved bounds for clique sizes in $C_4$-free graphs with large minimum degree.

Proof of a conjecture on the existence of large cliques in regular $C_4$-free graphs.

Demonstration that the bounds are tight using the $k$-th power of cycle $C_{4k+1}$.

Abstract

A graph $G$ is called $C_4$-free if it does not contain the cycle $C_4$ as an induced subgraph. Hubenko, Solymosi and the first author proved (answering a question of Erd\H os) a peculiar property of $C_4$-free graphs: $C_4$ graphs with $n$ vertices and average degree at least $cn$ contain a complete subgraph (clique) of size at least $c'n$ (with $c'= 0.1c^2n$). We prove here better bounds (${c^2n\over 2+c}$ in general and $(c-1/3)n$ when $ c \le 0.733$) from the stronger assumption that the $C_4$-free graphs have minimum degree at least $cn$. Our main result is a theorem for regular graphs, conjectured in the paper mentioned above: $2k$-regular $C_4$-free graphs on $4k+1$ vertices contain a clique of size $k+1$. This is best possible shown by the $k$-th power of the cycle $C_{4k+1}$.