Super-pancyclic hypergraphs and bipartite graphs

DOI10.1016/J.JCTB.2020.06.007MaRDI QIDQ2200932zbMATHOpenAlexFDO

Authors Ruth Luo, Dara Zirlin, Alexandr Kostochka

Publication date 24 September 2020

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1905.03758

zbMATH Keywords

bipartite graphsextremal hypergraph theoryBerge cycles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Hypergraphs (05C65)

Abstract: We find Dirac-type sufficient conditions for a hypergraph $mathcalH$ with few edges to be hamiltonian. We also show that these conditions provide that $mathcalH$ is {em super-pancyclic}, i.e., for each $AsubseteqV(mathcalH)$ with $|A|geq3$, $mathcalH$ contains a Berge cycle with vertex set $A$. We mostly use the language of bipartite graphs, because every bipartite graph is the incidence graph of a multihypergraph. In particular, we extend some results of Jackson on the existence of long cycles in bipartite graphs where the vertices in one part have high minimum degree. Furthermore, we prove a conjecture of Jackson from 1981 on long cycles in 2-connected bipartite graphs.

Recommendations

• Supereulerian bipartite digraphs
• On super-edge-connected digraphs and bipartite digraphs
• Supersaturated graphs and hypergraphs
• Super-connectivity and hyper-connectivity of vertex transitive bipartite graphs
• Superconnectivity of bipartite digraphs and graphs
• scientific article; zbMATH DE number 5671145
• Super-\(\lambda \) connectivity of bipartite graphs.
• Supereulerian graphs and the Petersen graph
• scientific article; zbMATH DE number 26482
• Supereulerian graphs and the Petersen graph

Cites work

• scientific article; zbMATH DE number 3902696 (Why is no real title available?)
• scientific article; zbMATH DE number 3506739 (Why is no real title available?)
• Cycles in bipartite graphs
• Long cycles in bipartite graphs
• Maximal Cycles in Bipartite Graphs
• Multicoloured Hamilton cycles
• On \(r\)-uniform hypergraphs with circumference less than \(r\)
• Pancyclic graphs. I

Cited in

(7)

• Extremal problems of Erdős, Faudree, Schelp and Simonovits on paths and cycles
• Supersaturated graphs and hypergraphs
• Longest cycles in 3‐connected hypergraphs and bipartite graphs
• Pósa-type results for Berge hypergraphs
• scientific article; zbMATH DE number 5671145 (Why is no real title available?)
• Conditions for a bigraph to be super-cyclic
• On Hamiltonian Berge cycles in [3]-uniform hypergraphs

This page was built for publication: Super-pancyclic hypergraphs and bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200932)