Loose cores and cycles in random hypergraphs

DOI10.37236/10794zbMath1503.05108arXiv2101.05008OpenAlexW4307047734MaRDI QIDQ2094881

Julian Zalla, Mihyun Kang, Oliver Cooley

Publication date: 8 November 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

\texttt{CoreConstruct}longest loose cycleloose core

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Paths and cycles (05C38)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the robustness of random \(k\)-cores
• Encores on cores
• Asymptotic normality of the \(k\)-core in random graphs
• Finite size scaling for the core of large random hypergraphs
• Component structure in the evolution of random hypergraphs
• The longest path in a random graph
• Size and connectivity of the \(k\)-core of a random graph
• The phase transition in a random hypergraph
• Sudden emergence of a giant \(k\)-core in a random graph
• The size of the giant component in random hypergraphs: a short proof
• On the strength of connectedness of a random hypergraph
• The order of the giant component of random hypergraphs
• Asymptotic normality of the size of the giant component in a random hypergraph
• A simple solution to the k‐core problem
• Information, Physics, and Computation
• Cycles in a random graph near the critical point
• The stripping process can be slow: Part I
• The size of the giant high‐order component in random hypergraphs
• Largest Components in Random Hypergraphs
• The solution space geometry of random linear equations
• Subcritical Random Hypergraphs, High-Order Components, and Hypertrees
• Longest Paths in Random Hypergraphs
• An Improved Upper Bound on the Length of the Longest Cycle of a Supercritical Random Graph
• Cores in random hypergraphs and Boolean formulas
• On the Method of Typical Bounded Differences
• Local Limit Theorems for the Giant Component of Random Hypergraphs
• Thek-Core and Branching Processes
• Poisson Cloning Model for Random Graphs
• Exploring hypergraphs with martingales
• The Stripping Process Can be Slow: Part II

This page was built for publication: Loose cores and cycles in random hypergraphs