Transversal Hamilton cycle in hypergraph systems

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
A survey on Hamilton cycles in directed graphs
Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
Rainbow Hamilton cycles in uniform hypergraphs
Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
Loose Hamilton cycles in hypergraphs
Hamiltonicity in randomly perturbed hypergraphs
Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
An approximate Dirac-type theorem for $k$-uniform hypergraphs
How to avoid using the regularity Lemma: Pósa's conjecture revisited
Dirac-type results for loose Hamilton cycles in uniform hypergraphs
Hamilton $\ell $-cycles in uniform hypergraphs
Perfect matchings in large uniform hypergraphs with large minimum collective degree
Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
Hamilton $\ell$-cycles in randomly perturbed hypergraphs
Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
Loose Hamiltonian cycles forced by large $(k-2)$-degree -- sharp version
Rainbow matchings for 3-uniform hypergraphs
Rainbow pancyclicity in graph systems
From one to many rainbow Hamiltonian cycles
Dirac-type theorems in random hypergraphs
Hamiltonian paths and cycles in some 4-uniform hypergraphs
Minimum codegree threshold for Hamilton $\ell$-cycles in $k$-uniform hypergraphs
Rainbow factors in hypergraphs
Extensions of results on rainbow Hamilton cycles in uniform hypergraphs
Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
The average number of spanning trees in sparse graphs with given degrees
Long rainbow paths and rainbow cycles in edge colored graphs. A survey
Recent advances on the Hamiltonian problem: survey III
On Hamiltonian bipartite graphs
Transversals and bipancyclicity in bipartite graph families
Almost all optimally coloured complete graphs contain a rainbow Hamilton path
A better bound on the size of rainbow matchings
Properly colored Hamilton cycles in Dirac-type hypergraphs
Rainbow matchings and Hamilton cycles in random graphs
The Size of a Hypergraph and its Matching Number
Recent advances on Dirac-type problems for hypergraphs
Rainbow Hamilton cycles in random graphs and hypergraphs
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
On a rainbow version of Dirac's theorem
A Dirac-Type Theorem for 3-Uniform Hypergraphs
Rainbow Turán Problems
Rainbow and orthogonal paths in factorizations ofKn
Hamiltonian chains in hypergraphs
On Rainbow Matchings for Hypergraphs
Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs
Rainbow Perfect Matchings for 4-Uniform Hypergraphs
A rainbow version of Mantel's Theorem
Simple juntas for shifted families
A Rainbow Dirac's Theorem
Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version
Rainbow hamilton cycles in random graphs
Some Theorems on Abstract Graphs
Transversal factors and spanning trees
Rainbow version of the Erdős Matching Conjecture via concentration
Rainbow spanning structures in graph and hypergraph systems
Minimum degree conditions for tight Hamilton cycles
A general approach to transversal versions of Dirac‐type theorems
Resilience for tight Hamiltonicity

This page was built for publication: Transversal Hamilton cycle in hypergraph systems