Anti-directed cycle-factors in oriented graphs
From MaRDI portal
Cites work
- \(F\)-factors in hypergraphs via absorption
- A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
- A geometric theory for hypergraph matching
- A Ramsey–Turán theory for tilings in graphs
- An exact minimum degree condition for Hamilton cycles in oriented graphs
- Arbitrary orientations of Hamilton cycles in oriented graphs
- Combinatorial and computational aspects of graph packing and graph decomposition
- Cycle-factors in oriented graphs
- Cyclic triangle factors in regular tournaments
- Decision problem for perfect matchings in dense k-uniform hypergraphs
- scientific article; zbMATH DE number 3700874 (Why is no real title available?)
- scientific article; zbMATH DE number 3632516 (Why is no real title available?)
- scientific article; zbMATH DE number 1047732 (Why is no real title available?)
- scientific article; zbMATH DE number 878896 (Why is no real title available?)
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- Near Perfect Matchings in ${k}$-Uniform Hypergraphs II
- On a Ramsey-Turán variant of the Hajnal-Szemerédi theorem
- On maximal paths and circuits of graphs
- On perfect matchings in uniform hypergraphs with large minimum vertex degree
- On the maximal number of independent circuits in a graph
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Semi-degree threshold for anti-directed Hamiltonian cycles
- Some Theorems on Abstract Graphs
- Testing subgraphs in directed graphs
- Tiling transitive tournaments and their blow-ups
- Transitive tournament tilings in oriented graphs with large minimum total degree
- Transitive triangle tilings in oriented graphs
- Triangle packings and 1-factors in oriented graphs
This page was built for publication: Anti-directed cycle-factors in oriented graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7303145)