Transversal Hamilton cycle in hypergraph systems
From MaRDI portal
Recommendations
Cites work
- A better bound on the size of rainbow matchings
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- A general approach to transversal versions of Dirac‐type theorems
- A rainbow Dirac's theorem
- A rainbow version of Mantel's theorem
- A survey on Hamilton cycles in directed graphs
- Almost all optimally coloured complete graphs contain a rainbow Hamilton path
- An approximate Dirac-type theorem for k-uniform hypergraphs
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
- Dirac-type questions for hypergraphs -- a survey (or more problems for Endre to solve)
- Dirac-type results for loose Hamilton cycles in uniform hypergraphs
- Dirac-type theorems in random hypergraphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Extensions of results on rainbow Hamilton cycles in uniform hypergraphs
- From one to many rainbow Hamiltonian cycles
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- Hamilton -cycles in randomly perturbed hypergraphs
- Hamiltonian chains in hypergraphs
- Hamiltonian paths and cycles in some 4-uniform hypergraphs
- Hamiltonicity in randomly perturbed hypergraphs
- How to avoid using the regularity Lemma: Pósa's conjecture revisited
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Long rainbow cycles in proper edge-colorings of complete graphs
- Long rainbow paths and rainbow cycles in edge colored graphs. A survey
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Loose Hamilton cycles in hypergraphs
- Loose Hamiltonian cycles forced by large (k-2)-degree-approximate version
- Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
- Minimum degree conditions for tight Hamilton cycles
- Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
- Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
- On a rainbow version of Dirac's theorem
- On Hamiltonian bipartite graphs
- On rainbow cycles in edge colored complete graphs
- On Rainbow Matchings for Hypergraphs
- Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Properly colored Hamilton cycles in Dirac-type hypergraphs
- Rainbow and orthogonal paths in factorizations of K_n
- Rainbow factors in hypergraphs
- Rainbow Hamilton cycles in random graphs
- Rainbow Hamilton cycles in random graphs and hypergraphs
- Rainbow Hamilton cycles in uniform hypergraphs
- Rainbow matchings and Hamilton cycles in random graphs
- Rainbow matchings for 3-uniform hypergraphs
- Rainbow pancyclicity in graph systems
- Rainbow perfect matchings for 4-uniform hypergraphs
- Rainbow spanning structures in graph and hypergraph systems
- Rainbow Turán Problems
- Rainbow version of the Erdős Matching Conjecture via concentration
- Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
- Recent advances on Dirac-type problems for hypergraphs
- Recent advances on the Hamiltonian problem: survey III
- Resilience for tight Hamiltonicity
- Simple juntas for shifted families
- Some Theorems on Abstract Graphs
- The average number of spanning trees in sparse graphs with given degrees
- The size of a hypergraph and its matching number
- Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs
- Transversal factors and spanning trees
- Transversals and bipancyclicity in bipartite graph families
Cited in
(5)
This page was built for publication: Transversal Hamilton cycle in hypergraph systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6668348)
