Pósa-type results for Berge hypergraphs
From MaRDI portal
Publication:6574381
Recommendations
Cites work
- scientific article; zbMATH DE number 3641483 (Why is no real title available?)
- scientific article; zbMATH DE number 3293646 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- scientific article; zbMATH DE number 3186565 (Why is no real title available?)
- A Theorem on Planar Graphs
- A degree sequence strengthening of the vertex degree threshold for a perfect matching in 3-uniform hypergraphs
- A rainbow Dirac's theorem
- Advances on the Hamiltonian problem -- a survey
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
- Avoiding long Berge cycles
- Avoiding long Berge cycles: the missing cases \(k=r+1\) and \(k=r+2\)
- Berge cycles in non-uniform hypergraphs
- Conditions for a bigraph to be super-cyclic
- Connected hypergraphs without long Berge-paths
- Cycles in bipartite graphs
- Cycles of given lengths in hypergraphs
- Dirac-type theorems for long Berge cycles in hypergraphs
- Hamiltonian chains in hypergraphs
- Long cycles in bipartite graphs
- Longest cycles in 3‐connected hypergraphs and bipartite graphs
- On Hamilton's ideals
- On \(r\)-uniform hypergraphs with circumference less than \(r\)
- On perfect matchings in uniform hypergraphs with large minimum vertex degree
- Recent advances on the Hamiltonian problem: survey III
- Short proof that Kneser graphs are Hamiltonian for n 4k
- Some Theorems on Abstract Graphs
- Stability of extremal connected hypergraphs avoiding Berge-paths
- Super-pancyclic hypergraphs and bipartite graphs
- The structure of hypergraphs without long Berge cycles
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)
