Pósa-type results for Berge hypergraphs
From MaRDI portal
Publication:6574381
DOI10.37236/11704zbMATH Open1543.05143MaRDI QIDQ6574381FDOQ6574381
Authors: Nika Salia 
Publication date: 18 July 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Recommendations
Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Hypergraphs (05C65)
Cites Work
- On Hamilton's ideals
- Title not available (Why is that?)
- Some Theorems on Abstract Graphs
- On perfect matchings in uniform hypergraphs with large minimum vertex degree
- Hamiltonian chains in hypergraphs
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
- Long cycles in bipartite graphs
- Cycles in bipartite graphs
- A Theorem on Planar Graphs
- Title not available (Why is that?)
- Recent advances on the Hamiltonian problem: survey III
- Advances on the Hamiltonian problem -- a survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- On \(r\)-uniform hypergraphs with circumference less than \(r\)
- Avoiding long Berge cycles
- Cycles of given lengths in hypergraphs
- Super-pancyclic hypergraphs and bipartite graphs
- Avoiding long Berge cycles: the missing cases \(k=r+1\) and \(k=r+2\)
- Berge cycles in non-uniform hypergraphs
- The structure of hypergraphs without long Berge cycles
- Connected hypergraphs without long Berge-paths
- Short proof that Kneser graphs are Hamiltonian for \(n \geqslant 4k\)
- A rainbow Dirac's theorem
- Conditions for a bigraph to be super-cyclic
- Longest cycles in 3‐connected hypergraphs and bipartite graphs
- A degree sequence strengthening of the vertex degree threshold for a perfect matching in 3-uniform hypergraphs
- Stability of extremal connected hypergraphs avoiding Berge-paths
- Dirac-type theorems for long Berge cycles in hypergraphs
Cited In (1)
This page was built for publication: Pósa-type results for Berge hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6574381)
