Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 18 min ago
PreprintCC BY-NC-SA 4.0arXiv

Forbidding r-extension of C4 -- a counterexample of the Anstee-Sali conjecture

  • Richard P. Anstee
  • Attila Sali
  • Pei Wu
Open at sourcePDFDOICite

Abstract

In this note we prove forb(n,1r−2× C4)=Θ(nr−1/2), thus providing a series of counterexamples of a 2005 conjecture of the first two authors. Here 1r−2× C4 is the r-extension of the 4-cycle, that is the r-uniform hypergraph of four edges obtained by joining a set of r−2 vertices to each edge of C4. forb(n,F) is the largest number of edges of a simple hypergraph G on n vertices without \emph{trace} (induced subhypergraph) F.

Related

  1. A counterexample to a conjecture of Duncan on versal actions
    Federico Scavia
    HALPreprintLicence not statedAlgebra & number theoryHAL
  2. A Counterexample to the Eventual Stability Conjecture
    Thomas J. Tucker, Zheng Zhu
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  3. A non-klt counterexample to Shokurov's index conjecture
    Yusuke Nakamura, Kohsuke Shibata
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  4. A counterexample to the wrapping number conjecture
    Qiuyu Ren
    arXivPreprintarXiv licenceFull textGeometry & topologyarXiv
  5. A counterexample to a log-concavity conjecture of Brenti
    Christian Gaetz
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{anstee2026forbidding,
  title = {{Forbidding $r$-extension of $C_4$ -- a counterexample of the Anstee-Sali conjecture}},
  author = {Richard P. Anstee and Attila Sali and Pei Wu},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.13987},
  eprint = {2610.13987},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.13987},
  note = {CC BY-NC-SA 4.0},
}
RIS
TY  - UNPB
TI  - Forbidding r-extension of C_4 -- a counterexample of the Anstee-Sali conjecture
AU  - Richard P. Anstee
AU  - Attila Sali
AU  - Pei Wu
PY  - 2026
DA  - 2026/10/01
PB  - arXiv
DO  - 10.48550/arxiv.2610.13987
UR  - https://arxiv.org/abs/2610.13987
AB  - In this note we prove forb(n,1_r−2× C_4)=Θ(n^r−1/2), thus providing a series of counterexamples of a 2005 conjecture of the first two authors. Here 1_r−2× C_4 is the r-extension of the 4-cycle, that is the r-uniform hypergraph of four edges obtained by joining a set of r−2 vertices to each edge of C_4. forb(n,F) is the largest number of edges of a simple hypergraph G on n vertices without \emph{trace} (induced subhypergraph) F.
ER  -