Metraipolis › archive › dc_bfc1204dbf08

On Colorful Kruskal--Katona Theorems — arXiv:2610.02165

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.02165
License (as archived)
CC0-1.0
Archived
2026-10-06T17:41:46.289Z
SHA-256 of the archived text
597791431f560961b3e02587110ec391d07e5fa5d989a5cc821975522193a8da
Stable URL of this page
https://metraipolis.com/documento/dc_bfc1204dbf08

How to cite

On Colorful Kruskal--Katona Theorems — arXiv:2610.02165 — arXiv (en), https://arxiv.org/abs/2610.02165 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bfc1204dbf08 (Metraipolis archive dc_bfc1204dbf08, sha256 597791431f560961b3e02587110ec391d07e5fa5d989a5cc821975522193a8da)
BibTeX
@misc{dcbfc1204dbf08,
  title = {On Colorful Kruskal--Katona Theorems — arXiv:2610.02165},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.02165},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bfc1204dbf08; sha256 597791431f560961b3e02587110ec391d07e5fa5d989a5cc821975522193a8da},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.02165. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

What is the maximum number of rainbow triangles in an edge-colored graph with $m$ edges and $r$ colors? Using entropic techniques, we prove an upper bound of $C_rm^{3/2}$ rainbow triangles with $C_r=\sqrt{\frac{2(r-2)}{9r}}$; this constant is best possible whenever there exists an affine plane of order $r-1$. We also show that constructions attaining at least $(C_r-\varepsilon_r)m^{3/2}$ rainbow triangles must exhibit an affine plane structure, which further improves the upper bound if no such affine plane exists. We also consider the problem of counting properly edge-colored cliques of larger sizes. Surprisingly, if the number $r$ of colors is odd, this count is instead maximized by blowups of a properly edge-colored $K_{r+1}$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-02 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.02165 — 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-06T16:06:55.882Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).