Counting extensions revisited

DOI10.1002/rsa.21050zbMath1522.05445arXiv1911.03012OpenAlexW4214509821MaRDI QIDQ6074702

Matas Šileikis, Lutz Warnke

Publication date: 12 October 2023

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

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

zbMATH Keywords

extreme valuesrandom graphsubgraph countsrooted subgraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Combinatorial probability (60C05) Ramsey theory (05D10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• General deletion lemmas via the Harris inequality
• The early evolution of the \(H\)-free process
• A useful elementary correlation inequality
• Matching and covering the vertices of a random graph by copies of a given graph
• Upper tails for arithmetic progressions in random subsets
• Threshold functions for extension statements
• On the missing log in upper tail estimates
• A general method for lower bounds on fluctuations of random variables
• Random triangle removal
• Local resilience for squares of almost spanning cycles in sparse random graphs
• Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs
• Counting extensions
• On the Choice Number of Random Hypergraphs
• The lower tail: Poisson approximation revisited
• Introduction to Random Graphs
• Chasing robbers on random graphs: Zigzag theorem
• Laws of Small Numbers: Extremes and Rare Events
• Zero-One Laws for Sparse Random Graphs
• Poisson approximation for large deviations
• When Does the Zero-One Law Hold?
• The infamous upper tail
• Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs
• On the cycle space of a random graph
• Paths in graphs
• Crossing numbers of random graphs
• The Janson inequalities for general up‐sets
• The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
• A counterexample to the DeMarco‐Kahn upper tail conjecture
• Large girth approximate Steiner triple systems
• The Reverse H‐free Process for Strictly 2‐Balanced Graphs
• The VC dimension of k‐uniform random hypergraphs
• On the Method of Typical Bounded Differences
• Online Ramsey games for more than two colors
• The strange logic of random graphs
• Dynamic concentration of the triangle‐free process

This page was built for publication: Counting extensions revisited