Metraipolis › archive › dc_38bbb0bf998d
Triangle-free Rank--Ramsey graphs from ordered incidence lifts — arXiv:2610.22902
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.22902
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T09:39:22.249Z
- SHA-256 of the archived text
f4bbdb604937e053d3cb9ec86739736d14295e4cdd28a02ea601d630482f0b3b- Stable URL of this page
https://metraipolis.com/documento/dc_38bbb0bf998d
How to cite
Triangle-free Rank--Ramsey graphs from ordered incidence lifts — arXiv:2610.22902 — arXiv (en), https://arxiv.org/abs/2610.22902 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_38bbb0bf998d (Metraipolis archive dc_38bbb0bf998d, sha256 f4bbdb604937e053d3cb9ec86739736d14295e4cdd28a02ea601d630482f0b3b)
BibTeX
@misc{dc38bbb0bf998d,
title = {Triangle-free Rank--Ramsey graphs from ordered incidence lifts — arXiv:2610.22902},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.22902},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_38bbb0bf998d; sha256 f4bbdb604937e053d3cb9ec86739736d14295e4cdd28a02ea601d630482f0b3b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.22902. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For a graph $G$ with adjacency matrix $A_G$ and a coefficient field $\mathbb K$, put $\rho_{\mathbb K}(G)=\operatorname{rank}_{\mathbb K}(A_G+I)$. We answer the triangle-free Rank--Ramsey existence question of Beniamini, Linial and Shraibman. For every order $n$, we construct a triangle-free graph $H_n$ such that, simultaneously over all coefficient fields, $$ \rho_{\mathbb K}(H_n)=\bigl(4(2/3)^{3/4}+o(1)\bigr)n^{3/4}, $$ with an error uniform in the field. The graphs can be chosen Hamiltonian for all sufficiently large $n$. Our method combines ordered layers of point--line incidence flags with a common low-dimensional endpoint space. We determine the exact real rank, independence number and chromatic number of the affine lifts. For all triangle-free complete incidence lifts, we obtain a sharp two-term lower bound for complete incidence lifts, with sharpness witnessed by projective-plane incidence graphs over suitable coefficient fields. We also establish a third-order estimate and stability near equality. On the same explicit graphs, both the Lovász number and minimum semidefinite rank exceed the prescribed Boolean-matrix rank by polynomial factors. Thus neither parameter has a universal constant-factor upper bound in terms of complement rank. We determine Shannon capacity in the short-layer range.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.22902 — 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-19T09:34:59.738Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).