The probabilistic method. With an appendix on the life and work of Paul Erdős.
From MaRDI portal
Redirect page
Recommendations
Cited in
(only showing first 100 items - show all)- Distant set distinguishing total colourings of graphs
- A new bound for 3-satisfiable MaxSat and its algorithmic application
- Maximal independent sets in bipartite graphs obtained from Boolean lattices
- On high-dimensional acyclic tournaments
- New bounds for the distance Ramsey number
- Balanced independent sets and colorings of hypergraphs
- Random Gromov's monsters do not act non-elementarily on hyperbolic spaces
- An estimate for the probability of dependent events
- Large communities in a scale-free network
- Voting paradoxes and digraphs realizations
- Probabilistic construction of some extremal p-groups
- Limits of locally-globally convergent graph sequences
- Edge colouring by total labellings
- Asymptotically the list colouring constants are 1
- Combinatorial extremum problems for 2-colorings of hypergraphs
- Upper tails for subgraph counts in random graphs
- The rank of sparse random matrices
- Rank of random half-integral polytopes. Extended abstract
- Assortment optimization under the paired combinatorial logit model
- Expander properties and the cover time of random intersection graphs
- Can colour-blind distinguish colour palettes?
- Stationary distribution and cover time of random walks on random digraphs
- On defensive alliances and strong global offensive alliances
- Measurable versions of the Lovász local lemma and measurable graph colorings
- Independence numbers and chromatic numbers of some distance graphs
- Relating multiway discrepancy and singular values of nonnegative rectangular matrices
- Randomized approximation for the set multicover problem in hypergraphs
- Dynamic moral hazard without commitment
- Bounded quantifier depth spectra for random graphs
- Discrepancy, chaining and subgaussian processes
- Cubic polyhedral Ramanujan graphs with face size no larger than six
- \(t\)-wise independence with local dependencies
- Conditional probability logic, lifted Bayesian networks, and almost sure quantifier elimination
- Upper bounds on the global offensive alliances in graphs
- Ranking graphs through hitting times of Markov chains
- On the zero-one k-law extensions
- Large disjoint subgraphs with the same order and size
- New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
- On compiling structured CNFs to OBDDs
- On the distance domination number of bipartite graphs
- A short proof of Bernoulli disjointness via the local lemma
- Ramsey numbers and bipartite Ramsey numbers via quasi-random graphs
- The threshold function for vanishing of the top homology group of random \(d\)-complexes
- On codeword design in metric DNA spaces
- On Ramsey Type Problems in Combinatorial Geometry
- \((2,1)\)-separating systems beyond the probabilistic bound
- Correlation through bounded recall strategies
- Properties of Boolean functions with the extremal number of prime implicants
- An almost quadratic bound on vertex Folkman numbers
- EMSO(FO^2) 0-1 Law Fails for All Dense Random Graphs
- On the maximum degree of induced subgraphs of the Kneser graph
- Small spectral gap in the combinatorial Laplacian implies Hamiltonian
- A slight sharpening of LMN
- Colouring Non-sparse Random Intersection Graphs
- Counterexamples to Borsuk's conjecture on spheres of small radius
- Zero-one \(k\)-law
- Perfect matching in random graphs is as hard as Tseitin
- On the number of orientations of random graphs with no directed cycles of a given length
- On point-line incidences in vector spaces over finite fields
- Generalized arboricity of graphs with large girth
- Two remarks on the Burr-Erdős conjecture
- Random binary trees: from the average case analysis to the asymptotics of distributions
- Properly coloured Hamiltonian cycles in edge-coloured complete graphs
- The number of occurrences of a fixed spread among \(n\) directions in vector spaces over finite fields
- The 1-2-3 conjecture holds for graphs with large enough minimum degree
- Combinatorial and computational aspects of graph packing and graph decomposition
- On the generalized Erdős-Falconer distance problems over finite fields
- Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment
- Guarantees for the success frequency of an algorithm for finding Dodgson-election winners
- On random subgraphs of Kneser and Schrijver graphs
- Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability
- The convexification effect of Minkowski summation
- Projections in vector spaces over finite fields
- Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices
- Bounded quantifier depth spectrum for random uniform hypergraphs
- Hamilton decompositions of regular expanders: applications
- Locally consistent constraint satisfaction problems
- Constrained submodular maximization via a nonsymmetric technique
- From Delaunay triangulation to topological data analysis: generation of more realistic synthetic power grid networks
- Perfect matchings in uniform hypergraphs with large minimum degree
- Two problems on independent sets in graphs
- Selected Combinatorial Properties of Random Intersection Graphs
- Codes identifying sets of vertices in random networks
- Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality
- The strategic value of recall
- The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
- Novel scaling limits for critical inhomogeneous random graphs
- Compositions of random transpositions
- \(H\)-colouring bipartite graphs
- Crossover can provably be useful in evolutionary computation
- The maximum edit distance from hereditary graph properties
- On the chromatic number of random graphs
- A structure theorem for Boolean functions with small total influences
- Rainbow paths
- A randomised approximation algorithm for the hitting set problem
- Ample simplicial complexes
- A note on the distribution of the number of prime factors of the integers
- On rough isometries of Poisson processes on the line
- On the least trimmed squares estimator
This page was built for publication: The probabilistic method. With an appendix on the life and work of Paul Erdős.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784326)
