Conditions for a bigraph to be super-cyclic
Combinatorics
2020-06-30 v1
Abstract
A hypergraph is super-pancyclic if for each with , contains a Berge cycle with base vertex set . 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 with . We also consider super-cyclic bipartite graphs: those are -bigraphs such that for each with , has a cycle such that . 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