activity
20102021
most citedMinimum Number of k-Cliques in Graphs with Bounded Independence Number

14 citations · 41 across the 10 of their papers we have counts for

collaborators
Showing 2012Show all

2 papers · 1 filter

math.CO2012★ 14 cited

Minimum Number of k-Cliques in Graphs with Bounded Independence Number

Oleg Pikhurko, Emil R. Vaughan

Erdos asked in 1962 about the value of f(n,k,l), the minimum number of k-cliques in a graph of order n and independence number less than l. The case (k,l)=(3,3) was solved by Lorde…

math.CO2012

Turán H-densities for 3-graphs

Victor Falgas-Ravry, Emil R. Vaughan

Given an -graph on vertices, and a family of forbidden subgraphs, we define $\ex_{H}(n, \mathcal{F})$ to be the maximum number of induced copies of in…