Threshold functions
From MaRDI portal
Publication:1104940
DOI10.1007/BF02579198zbMATH Open0648.05048DBLPjournals/combinatorica/BollobasT87OpenAlexW2912057363WikidataQ63599100 ScholiaQ63599100MaRDI QIDQ1104940FDOQ1104940
Authors: Béla Bollobás, Andrew Thomason 
Publication date: 1987
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579198
Recommendations
- On the number of threshold functions
- Revising threshold functions
- scientific article; zbMATH DE number 850396
- Vector analysis of threshold functions
- Bounds for the number of threshold functions
- Spectral properties of threshold functions
- On the constructive characterization of threshold functions
- On threshold properties
- Weights of exact threshold functions
- Weights of exact threshold functions
Cited In (only showing first 100 items - show all)
- Online Ramsey games in random graphs
- An algorithmic framework for obtaining lower bounds for random Ramsey problems
- Thresholds versus fractional expectation-thresholds
- Every monotone graph property has a sharp threshold
- On an anti-Ramsey threshold for random graphs
- Graph bootstrap percolation
- Spanning structures and universality in sparse hypergraphs
- Simple juntas for shifted families
- Higher-Order Threshold Implementations
- Thresholds for families of multisets, with an application to graph pebbling
- On an anti-Ramsey property of random graphs
- Small subgraphs in random graphs and the power of multiple choices
- Boolean functions: influence, threshold and noise
- Specifying a positive threshold function via extremal points
- Sharp thresholds of graph properties, and the $k$-sat problem
- Threshold functions for incidence properties in finite vector spaces
- A graph property not satisfying a ``zero-one law
- Random sum-free subsets of abelian groups
- On \(K_{2, t}\)-bootstrap percolation
- Nowhere-zero flows in random graphs
- Further results on the rainbow vertex-disconnection of graphs
- Rainbow \(k\)-connectivity of random bipartite graphs
- A threshold for the maker-breaker clique game
- Note on a problem of M. Talagrand
- The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups
- Colorings of partial Steiner systems and their applications
- Matching theory -- a sampler: From Dénes König to the present
- Independent sets in hypergraphs and Ramsey properties of graphs and the integers
- The normalized matching property in random and pseudorandom bipartite graphs
- Control and optimal response problems for quasilinear impulsive integrodifferential equations
- Sharp thresholds for certain Ramsey properties of random graphs
- Universality for bounded degree spanning trees in randomly perturbed graphs
- On spanning structures in random hypergraphs
- Connector-breaker games on random boards
- On topological minors in random simplicial complexes
- Vector analysis of threshold functions
- Complexity-theoretic models of phase transitions in search problems
- The SAT-UNSAT transition for random constraint satisfaction problems
- Waiter-client and client-waiter Hamiltonicity games on random graphs
- Hypergraph removal lemmas via robust sharp threshold theorems
- Matching and covering the vertices of a random graph by copies of a given graph
- Rainbow \(k\)-connection in dense graphs (extended abstract)
- Shadows and intersections: Stability and new proofs
- On rainbow-\(k\)-connectivity of random graphs
- On a problem of M. Talagrand
- The anti-Ramsey threshold of complete graphs
- Threshold functions for local properties of graphs: Triangles
- 2-universality in randomly perturbed graphs
- Scaling limits for the threshold window: when does a monotone Boolean function flip its outcome?
- Arbitrary Threshold Widths for Monotone, Symmetric Properties
- On the power of choice for Boolean functions
- Sharp thresholds in bootstrap percolation
- Thresholds and expectation-thresholds of monotone properties with small minterms
- On the threshold for the maker-breaker \(H\)-game
- Zero-One Laws for Sparse Random Graphs
- Sharpness of the phase transition for continuum percolation in \(\mathbb{R}^2\)
- Random perturbation of sparse graphs
- Deficiency zero for random reaction networks under a stochastic block model framework
- Orientation Ramsey thresholds for cycles and cliques
- More on the colorful monochromatic connectivity
- Threshold functions and Poisson convergence for systems of equations in random sets
- Embedding spanning bounded degree subgraphs in randomly perturbed graphs
- Robust Hamiltonicity of Dirac graphs
- General graph pebbling
- A decomposability index in logical analysis of data
- The Maker-Breaker Rado game on a random set of integers
- A hierarchy of randomness for graphs
- Prevalence of Multistationarity and Absolute Concentration Robustness in Reaction Networks
- Shadows of ordered graphs
- Anti-Ramsey threshold of cycles for sparse graphs
- Hypercontractivity for global functions and sharp thresholds
- Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- A proof of the Kahn–Kalai conjecture
- Prevalence of deficiency-zero reaction networks in an Erdős-Rényi framework
- Speed and concentration of the covering time for structured coupon collectors
- Girth, magnitude homology and phase transition of diagonality
- Almost spanning universality in random graphs
- KKL's influence on me
- Down‐set thresholds
- Threshold sampling
- On the threshold for Szemerédi's theorem with random differences
- Walker-breaker games on \(G_{n, p}\)
- Hitting times for Shamir's problem
- Mixed connectivity properties of random graphs and some special graphs
- Zero forcing with random sets
- Directed graphs with lower orientation Ramsey thresholds
- Searching for (sharp) thresholds in random structures: where are we now?
- Large cycles in random generalized Johnson graphs
- Spectrum of FO logic with quantifier depth 4 is finite
- Spread approximations for forbidden intersections problems
- Phase transition of degeneracy in minor-closed families
- The query complexity of witness finding
- Plane and planarity thresholds for random geometric graphs
- A Threshold Function for Harmonic Update
- Threshold for stability of weak saturation
- Asymptotics for Shamir's problem
- \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs
- An asymmetric random Rado theorem: 1-statement
- Rainbow and monochromatic vertex-connection of random graphs
This page was built for publication: Threshold functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104940)
