Metraipolis › archive › dc_7a7bc5fc2771
Range of Clique Counts in Graphs — arXiv:2609.21739
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.21739
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T02:10:31.854Z
- SHA-256 of the archived text
df2cbd9fb4e6d0c60e71cc7488f60679e5f62651b41ea16391372297b1a90de8- Stable URL of this page
https://metraipolis.com/documento/dc_7a7bc5fc2771
How to cite
Range of Clique Counts in Graphs — arXiv:2609.21739 — arXiv (en), https://arxiv.org/abs/2609.21739 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7a7bc5fc2771 (Metraipolis archive dc_7a7bc5fc2771, sha256 df2cbd9fb4e6d0c60e71cc7488f60679e5f62651b41ea16391372297b1a90de8)
BibTeX
@misc{dc7a7bc5fc2771,
title = {Range of Clique Counts in Graphs — arXiv:2609.21739},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.21739},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7a7bc5fc2771; sha256 df2cbd9fb4e6d0c60e71cc7488f60679e5f62651b41ea16391372297b1a90de8},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.21739. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $\gamma(G)$ denote the number of cliques in a graph $G$ and let $\Gamma(n):= \{\gamma(G):|V(G)|=n\}$ be the set of values of $\gamma(G)$ that can be attained on $n$ vertices. We improve on a result by Erdős and Erné to show that $| \Gamma(n)| \geq 2^{n-4\ln(2)\log^3(n)}$ for sufficiently large $n$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-21 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.21739 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T01:48:20.603Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).