Abstract

A hypergraph H\mathcal H is super-pancyclic if for each A⊆V(H)A \subseteq V(\mathcal H) with ∣A∣≥3|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} δ(\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 A⊆XA \subseteq X with ∣A∣≥3|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.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.