Transversal Hamilton cycle in the hypergraph system
From MaRDI portal
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
- 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)
- Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Extensions of results on rainbow Hamilton cycles in uniform hypergraphs
- Extremal problems for finite sets
- Families of triples with high minimum degree are Hamiltonian
- Forbidding Hamilton cycles in uniform hypergraphs
- From one to many rainbow Hamiltonian cycles
- Hamilton cycles in graphs and hypergraphs: an extremal perspective
- Hamiltonian chains in hypergraphs
- scientific article; zbMATH DE number 4170917 (Why is no real title available?)
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Hypergraphs, quasi-randomness, and conditions for regularity
- Long rainbow cycles in proper edge-colorings of complete graphs
- Long rainbow paths and rainbow cycles in edge colored graphs. A survey
- Minimum degree conditions for tight Hamilton cycles
- Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs
- Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
- Multicoloured Hamilton cycles
- On a rainbow version of Dirac's theorem
- On extremal hypergraphs for Hamiltonian cycles
- On Hamiltonian bipartite graphs
- On Hamiltonian cycles in hypergraphs with dense link graphs
- On rainbow cycles in edge colored complete graphs
- On Rainbow Matchings for Hypergraphs
- On the Hamiltonicity of triple systems with high minimum degree
- Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
- 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 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 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
- Regular Partitions of Hypergraphs: Counting Lemmas
- Simple juntas for shifted families
- Some Theorems on Abstract Graphs
- The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- The size of a hypergraph and its matching number
- Tight cycles and regular slices in dense hypergraphs
- Transversal Hamilton cycle in hypergraph systems
- Transversals and bipancyclicity in bipartite graph families
This page was built for publication: Transversal Hamilton cycle in the hypergraph system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7364157)
