English

Conditions for a bigraph to be super-cyclic

Combinatorics 2020-06-30 v1

Abstract

A hypergraph H\mathcal H is super-pancyclic if for each AV(H)A \subseteq V(\mathcal H) with A3|A| \geq 3, H\mathcal H contains a Berge cycle with base vertex set AA. We present two natural necessary conditions for a hypergraph to be super-pancyclic, and show that in several classes of hypergraphs these necessary conditions are also sufficient for this. In particular, they are sufficient for every hypergraph H\mathcal H with δ(H)max{V(H),E(H)+104} \delta(\mathcal H)\geq \max\{|V(\mathcal H)|, \frac{|E(\mathcal H)|+10}{4}\}. We also consider super-cyclic bipartite graphs: those are (X,Y)(X,Y)-bigraphs GG such that for each AXA \subseteq X with A3|A| \geq 3, GG has a cycle CAC_A such that V(CA)X=AV(C_A)\cap X=A. Such graphs are incidence graphs of super-pancyclic hypergraphs, and our proofs use the language of such graphs.

Keywords

Cite

@article{arxiv.2006.15730,
  title  = {Conditions for a bigraph to be super-cyclic},
  author = {Alexandr Kostochka and Mikhail Lavrov and Ruth Luo and Dara Zirlin},
  journal= {arXiv preprint arXiv:2006.15730},
  year   = {2020}
}

Comments

17 pages

R2 v1 2026-06-23T16:41:07.172Z