Metraipolis › archive › dc_ef827e9bced8
On the minimum number of triangles in balanced tripartite graphs with large minimum degree — arXiv:2609.20590
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.20590
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T04:47:27.442Z
- SHA-256 of the archived text
b4033a85222d03aea1882813ab421568cb2df2643fda3038b28cee70306fb02d- Stable URL of this page
https://metraipolis.com/documento/dc_ef827e9bced8
How to cite
On the minimum number of triangles in balanced tripartite graphs with large minimum degree — arXiv:2609.20590 — arXiv (en), https://arxiv.org/abs/2609.20590 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ef827e9bced8 (Metraipolis archive dc_ef827e9bced8, sha256 b4033a85222d03aea1882813ab421568cb2df2643fda3038b28cee70306fb02d)
BibTeX
@misc{dcef827e9bced8,
title = {On the minimum number of triangles in balanced tripartite graphs with large minimum degree — arXiv:2609.20590},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.20590},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ef827e9bced8; sha256 b4033a85222d03aea1882813ab421568cb2df2643fda3038b28cee70306fb02d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.20590. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $f(n,t)$ be the minimum number of triangles in a tripartite graph with $n$ vertices in each part and minimum degree at least $n+t$. In 1975, Bollobás, Erdős and Szemerédi proved that $f(n,1)=\min\{4,n\}$. They further remarked that it is ``very likely'' that $f(n,t)\ge4t^3$ for $n\ge5t$. They also proved that $f(n,t) \ge t^3$ for all integers $n \ge t \ge 1$. We construct graphs showing that, for all integers $t\ge1$ and $n\ge3t+2\lceil(1+\sqrt5)t/2\rceil$, \[ f(n,t)\le(1+\sqrt5)t^3+\left(1+\frac1{\sqrt5}\right)t^2. \] Here $1+\sqrt5\approx3.236<4$, and the displayed upper bound is strictly less than $4t^3$ for every $t\ge2$, disproving their proposed bound. We also improve their lower bound $t^3$ by showing that $f(n,t)\ge\frac{12}{5}t^3$ for all integers $t\ge2$ and $n\ge18t^6$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.20590 — 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-10T04:15:33.157Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).