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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.