{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:10Z","timestamp":1753893850217,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>A hypergraph $\\mathcal H$ is super-pancyclic if for each $A \\subseteq V(\\mathcal H)$ with $|A| \\geqslant 3$, $\\mathcal H$ contains a Berge cycle with base vertex set $A$. 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. In particular, they are sufficient for every hypergraph $\\mathcal H$ with $ \\delta(\\mathcal H)\\geqslant \\max\\{|V(\\mathcal H)|, \\frac{|E(\\mathcal H)|+10}{4}\\}$.\r\nWe also consider super-cyclic bipartite graphs: those are $(X,Y)$-bigraphs $G$ such that for each $A \\subseteq X$ with $|A| \\geqslant 3$, $G$ has a cycle $C_A$ such that $V(C_A)\\cap X=A$. Such graphs are incidence graphs of super-pancyclic hypergraphs, and our proofs use the language of such graphs.<\/jats:p>","DOI":"10.37236\/9683","type":"journal-article","created":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T06:13:10Z","timestamp":1610604790000},"source":"Crossref","is-referenced-by-count":1,"title":["Conditions for a Bigraph to be Super-Cyclic"],"prefix":"10.37236","volume":"28","author":[{"given":"Alexandr","family":"Kostochka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail","family":"Lavrov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruth","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dara","family":"Zirlin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2021,1,15]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v28i1p2\/8242","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v28i1p2\/8242","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T06:13:10Z","timestamp":1610604790000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v28i1p2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,15]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2021,1,14]]}},"URL":"https:\/\/doi.org\/10.37236\/9683","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2021,1,15]]},"article-number":"P1.2"}}