Andr\'asfai and Vega graphs in Ramsey-Tur\'an theory]

Given nonnegative integers $n\ge s$, we let ${\mathrm{ex}}(n,s)$ denote the maximum number of edges in a triangle-free graph $G$ on $n$ vertices with $\alpha(G)\le s$. In the early sixties Andr\'{a}sfai conjectured that for $n/3

Keywords:

• Combinatorics
• Vertex (geometry)
• Piecewise
• Discrete mathematics
• Graph
• Integer
• Mathematics

• Correction
• Source
• Cite
• Save
• Machine Reading By IdeaReader