Fractional cycle decompositions in hypergraphs

DOI10.1002/rsa.21070zbMath1522.05346arXiv2101.05526OpenAlexW4206035731MaRDI QIDQ6052479

Felix Joos, Marcus Kühn

Publication date: 17 October 2023

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.05526

zbMATH Keywords

cyclesrandom walkhypergraph decompositions

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random walks on graphs (05C81)

Related Items (2)

Random perfect matchings in regular graphs ⋮ Decomposing hypergraphs into cycle factors

Cites Work

• Integer and fractional packings of hypergraphs
• Integer and fractional packings in dense graphs
• An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
• Finding paths in graphs avoiding forbidden transitions
• Progress towards Nash-Williams' conjecture on triangle decompositions
• On the decomposition threshold of a given graph
• Edge-decompositions of graphs with high minimum degree
• Probability theory. A comprehensive course

This page was built for publication: Fractional cycle decompositions in hypergraphs