Threshold functions
From MaRDI portal
Publication:1104940
DOI10.1007/BF02579198zbMath0648.05048DBLPjournals/combinatorica/BollobasT87OpenAlexW2912057363WikidataQ63599100 ScholiaQ63599100MaRDI QIDQ1104940
Béla Bollobás, Andrew G. Thomason
Publication date: 1987
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579198
Related Items (88)
Rainbow version of the Erdős Matching Conjecture via concentration ⋮ A decomposability index in logical analysis of data ⋮ Boolean functions: influence, threshold and noise ⋮ Sharp thresholds of graph properties, and the $k$-sat problem ⋮ Sharpness of the phase transition for continuum percolation in \(\mathbb{R}^2\) ⋮ Anti-Ramsey threshold of cycles for sparse graphs ⋮ On spanning structures in random hypergraphs ⋮ Note on a problem of M. Talagrand ⋮ A threshold for the Maker-Breaker clique game ⋮ A graph property not satisfying a ``zero-one law ⋮ Prevalence of deficiency-zero reaction networks in an Erdös–Rényi framework ⋮ 2-universality in randomly perturbed graphs ⋮ The query complexity of witness finding ⋮ General graph pebbling ⋮ On the Power of Choice for Boolean Functions ⋮ More on the colorful monochromatic connectivity ⋮ On a problem of M. Talagrand ⋮ A proof of the Kahn–Kalai conjecture ⋮ Hypercontractivity for global functions and sharp thresholds ⋮ On an anti-Ramsey threshold for random graphs ⋮ Spanning structures and universality in sparse hypergraphs ⋮ Sharp thresholds in bootstrap percolation ⋮ Embedding spanning bounded degree subgraphs in randomly perturbed graphs ⋮ \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs ⋮ Rainbow connections of graphs: a survey ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Prevalence of Multistationarity and Absolute Concentration Robustness in Reaction Networks ⋮ Phase transition of degeneracy in minor-closed families ⋮ Threshold functions for incidence properties in finite vector spaces ⋮ Girth, magnitude homology and phase transition of diagonality ⋮ The anti-Ramsey threshold of complete graphs ⋮ KKL's influence on me ⋮ Scaling limits for the threshold window: when does a monotone Boolean function flip its outcome? ⋮ Zero forcing with random sets ⋮ Shadows of ordered graphs ⋮ The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups ⋮ On rainbow-\(k\)-connectivity of random graphs ⋮ Threshold functions and Poisson convergence for systems of equations in random sets ⋮ Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs ⋮ Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers ⋮ Asymptotics for Shamir's problem ⋮ Shadows and intersections: Stability and new proofs ⋮ Deficiency zero for random reaction networks under a stochastic block model framework ⋮ Threshold functions for local properties of graphs: Triangles ⋮ Thresholds and expectation-thresholds of monotone properties with small minterms ⋮ Online Ramsey Games in Random Graphs ⋮ Thresholds versus fractional expectation-thresholds ⋮ The Maker--Breaker Rado Game on a Random Set of Integers ⋮ An algorithmic framework for obtaining lower bounds for random Ramsey problems ⋮ Matching theory -- a sampler: From Dénes König to the present ⋮ Matching and covering the vertices of a random graph by copies of a given graph ⋮ Small subgraphs in random graphs and the power of multiple choices ⋮ Robust Hamiltonicity of Dirac graphs ⋮ Sharp thresholds for certain Ramsey properties of random graphs ⋮ Unnamed Item ⋮ Random sum-free subsets of abelian groups ⋮ Rainbow \(k\)-connectivity of random bipartite graphs ⋮ On topological minors in random simplicial complexes ⋮ Random perturbation of sparse graphs ⋮ The normalized matching property in random and pseudorandom bipartite graphs ⋮ Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems ⋮ Simple juntas for shifted families ⋮ Colorings of partial Steiner systems and their applications ⋮ Connector-breaker games on random boards ⋮ On \(K_{2, t}\)-bootstrap percolation ⋮ Further results on the rainbow vertex-disconnection of graphs ⋮ Universality for bounded degree spanning trees in randomly perturbed graphs ⋮ Plane and planarity thresholds for random geometric graphs ⋮ Mixed connectivity properties of random graphs and some special graphs ⋮ Every monotone graph property has a sharp threshold ⋮ The SAT-UNSAT transition for random constraint satisfaction problems ⋮ Large cycles in random generalized Johnson graphs ⋮ On the threshold for the Maker-BreakerH-game ⋮ Zero-One Laws for Sparse Random Graphs ⋮ On an anti-Ramsey property of random graphs ⋮ An asymmetric random Rado theorem: 1-statement ⋮ Complexity-theoretic models of phase transitions in search problems ⋮ Rainbow and monochromatic vertex-connection of random graphs ⋮ Speed and concentration of the covering time for structured coupon collectors ⋮ Control and optimal response problems for quasilinear impulsive integrodifferential equations ⋮ Anti-Ramsey threshold of cycles ⋮ Nowhere-zero flows in random graphs ⋮ A hierarchy of randomness for graphs ⋮ Orientation Ramsey Thresholds for Cycles and Cliques ⋮ Hitting times for Shamir’s problem ⋮ Graph bootstrap percolation ⋮ Probabilistic intuition holds for a class of small subgraph games ⋮ Waiter-client and client-waiter Hamiltonicity games on random graphs
This page was built for publication: Threshold functions