Clique-counting conjecture for bounded-degree graphs with a fixed number of edges
Let , let be a graph with edges and maximum degree at most , and write
Here denotes the number of copies of in , is the complete graph on vertices, and is the colex graph with edges. Bounded-degree edge-resource clique-counting conjecture. One has
The conjecture refines the paper's main theorem, which proves the analogous assertion for the total number of cliques. The source attributes this refinement to the authors' earlier work, but gives no resolution status, so it remains open here.
References
2 papers in this index state this conjecture (2017–2019). The statement above is taken from the most recent of them; the others are arXiv:1709.06163.
Source: Rachel Kirsch and A. J. Radcliffe, “Many cliques with few edges”, arXiv:1912.09872 (2021).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.