scientific article; zbMATH DE number 7771743
From MaRDI portal
Publication:6072059
zbMath1527.05158MaRDI QIDQ6072059
Fang Tian, Xiang-Feng Pan, Zi-Long Liu
Publication date: 29 November 2023
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/87/ajc_v87_p365.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)
Cites Work
- Unnamed Item
- Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees
- A note on the random greedy triangle-packing algorithm
- The triangle-free process
- On random greedy triangle packing
- On the number of linear multipartite hypergraphs with given size
- On the power of random greedy algorithms
- Connectivity of the linear uniform hypergraph process
- Random triangle removal
- To Prove and Conjecture: Paul Erdos and His Mathematics
- Asymptotic packing via a branching process
- On the number of linear hypergraphs of large girth
- A natural barrier in random greedy hypergraph matching
- Probability Inequalities for Sums of Bounded Random Variables
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
This page was built for publication:
