Cores of random \(r\)-partite hypergraphs

DOI10.1016/j.ipl.2011.10.017zbMath1243.68323OpenAlexW2138378323MaRDI QIDQ436312

Fabiano C. Botelho, Nivio Ziviani, Nicholas C. Wormald

Publication date: 20 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.10.017

zbMATH Keywords

analysis of algorithmsrandomized algorithmsminimal perfect hashingcores of hypergraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Randomized algorithms (68W20)

Related Items

Simple multi-party set reconciliation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Encores on cores
• The first cycles in an evolving graph
• Poisson convergence and Poisson processes with applications to random graphs
• Improved bounds for covering complete uniform hypergraphs
• Counting connected graphs inside-out
• Asymptotic enumeration of sparse graphs with a minimum degree constraint
• Differential equations for random processes and random graphs
• Sudden emergence of a giant \(k\)-core in a random graph
• On the strength of connectedness of a random graph
• Simple and Space-Efficient Minimal Perfect Hash Functions
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• A critical point for random graphs with a given degree sequence
• Paths in graphs
• Cores in random hypergraphs and Boolean formulas