Counting extensions
From MaRDI portal
Publication:2640616
DOI10.1016/0097-3165(90)90070-DzbMath0721.05033OpenAlexW2911322315MaRDI QIDQ2640616
Publication date: 1990
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(90)90070-d
Related Items (36)
Bounded quantifier depth spectra for random graphs ⋮ Strictly balanced uniform hypergraphs and generalizations of zero-one law ⋮ Expansions of geometries ⋮ Upper tails for subgraph counts in random graphs ⋮ Crossing numbers of random graphs ⋮ Concentration of non‐Lipschitz functions and applications ⋮ The infamous upper tail ⋮ Poisson approximation for large deviations ⋮ On fractional K‐factors of random graphs ⋮ Universal zero-one \(k\)-law ⋮ On the zero-one \(k\)-law extensions ⋮ Local resilience for squares of almost spanning cycles in sparse random graphs ⋮ Upper tails for arithmetic progressions in random subsets ⋮ Bounding Ramsey numbers through large deviation inequalities ⋮ Extension of the zero-one \(k\)-law ⋮ Dynamic concentration of the triangle‐free process ⋮ Counting extensions revisited ⋮ Weak saturation stability ⋮ Zero-one \(k\)-law ⋮ On the Method of Typical Bounded Differences ⋮ First-order zero-one law for the uniform model of the random graph ⋮ On the cycle space of a random graph ⋮ Zero-one laws for first-order formulas with a bounded quantifier depth ⋮ On the concentration of multivariate polynomials with small expectation ⋮ Online Ramsey games for more than two colors ⋮ Existential monadic second order convergence law fails on sparse random graphs ⋮ The early evolution of the \(H\)-free process ⋮ The lower tail: Poisson approximation revisited ⋮ On the missing log in upper tail estimates ⋮ Upper tail bounds for stars ⋮ Zero-one laws for \(k\)-variable first-order logic of sparse random graphs ⋮ Threshold spectra via the Ehrenfeucht game ⋮ The Final Size of theC4-Free Process ⋮ Zero-one laws for random \(k\)-partite graphs ⋮ The distribution of the maximum number of common neighbors in the random graph ⋮ On the zero-one 4-law for the Erdős-Rényi random graphs
Cites Work
This page was built for publication: Counting extensions
