On the random greedy linear uniform hypergraph packing

MaRDI QIDQ6072059zbMATH OpenFDO

Authors Fang Tian, Zi-Long Liu, Xiang-Feng Pan

Publication date 29 November 2023

Full work available at URL http://ajc.maths.uq.edu.au/pdf/87/ajc_v87_p365.pdf

zbMATH Keywords

linear \(k\)-uniform hypergraphrandom greedy \(k\)-clique removal algorithm

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

Recommendations

• On random greedy triangle packing
• On the random greedy F-free hypergraph process
• On the random greedy \(F\)-free hypergraph process
• scientific article; zbMATH DE number 903456
• A note on the random greedy triangle-packing algorithm

Cites work

• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• A natural barrier in random greedy hypergraph matching
• A note on the random greedy triangle-packing algorithm
• Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees
• Asymptotic packing via a branching process
• Connectivity of the linear uniform hypergraph process
• scientific article; zbMATH DE number 903456 (Why is no real title available?)
• On random greedy triangle packing
• On the number of linear hypergraphs of large girth
• On the number of linear multipartite hypergraphs with given size
• On the power of random greedy algorithms
• Probability Inequalities for Sums of Bounded Random Variables
• Random triangle removal
• The triangle-free process
• To Prove and Conjecture: Paul Erdos and His Mathematics

Cited in

(1)

• Random Covering and Packing on the Line

This page was built for publication: On the random greedy linear uniform hypergraph packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6072059)