The probabilistic method
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Some results on (a:b)-choosability
- Matchings and independent sets of a fixed size in regular graphs
- Packing of partial designs
- Approximability of maximum splitting of k-sets and some other Apx-complete problems
- Random numerical semigroups and a simplicial complex of irreducible semigroups
- Random monomial ideals
- Ramsey-nice families of graphs
- How unproportional must a graph be?
- Ultimate data hiding in quantum mechanics and beyond
- Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
- A note on panchromatic colorings
- Coding for locality in reconstructing permutations
- Computing large independent sets in a single round
- The power of averaging at two consecutive time steps: proof of a mixing conjecture by Aldous and Fill
- Approximating a convex body by a polytope using the epsilon-net theorem
- On the sum of k largest distance eigenvalues of graphs
- Sandpiles on the square lattice
- New bounds on Simonyi's conjecture
- On generalized Stanley sequences
- A moment-generating formula for Erdős-Rényi component sizes
- Paths and cycles in random subgraphs of graphs with large minimum degree
- On the realization of random graphs as distance graphs in spaces of fixed dimension
- Near-perfect clique-factors in sparse pseudorandom graphs
- Determinantal probability measures
- Tough Ramsey graphs without short cycles
- A lattice point problem and additive number theory
- Learning fallible deterministic finite automata
- An effective additive basis for the integers
- Concentration of measure and isoperimetric inequalities in product spaces
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
- Efficient PRAM simulation on a distributed memory machine
- On difference graphs and the local dimension of posets
- A large deviation principle for the Erdős-Rényi uniform random graph
- Representability of Lyndon-Maddux relation algebras
- Cycles of given lengths in unicyclic components in sparse random graphs
- The conjunction of the linear arboricity conjecture and Lovász's path partition theorem
- Nonrepetitive list colorings of the integers
- The normalized matching property in random and pseudorandom bipartite graphs
- Cycle lengths in expanding graphs
- Tournament quasirandomness from local counting
- Lower bounds for superpatterns and universal sequences
- Anti-concentration for subgraph counts in random graphs
- On explicit random-like tournaments
- Clustering in a hyperbolic model of complex networks
- Covering graphs by monochromatic trees and Helly-type results for hypergraphs
- Randomized construction of complexes with large diameter
- Variations on twins in permutations
- On the size of subsets of \(\mathbb{F}_p^n\) without \(p\) distinct elements summing to zero
- Anchored expansion of Delaunay complexes in real hyperbolic space and stationary point processes
- Triangle-free subgraphs of hypergraphs
- On the number of forests and connected spanning subgraphs
- Constants of the Kahane-Salem-Zygmund inequality asymptotically bounded by 1
- A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP
- Improved bounds for the sunflower lemma
- How far do activated random walkers spread from a single source?
- Train tracks with gaps: applying the probabilistic method to trains
- On the permanent of a random symmetric matrix
- On simple connectivity of random 2-complexes
- Random Van der Waerden theorem
- On the maximal number of elements pairwise generating the symmetric group of even degree
- On the hat guessing number of graphs
- Real-time error correction codes for deletable errors
- Cliques and chromatic number in multiregime random graphs
- On the exponential ranking and its linear counterpart
- On the performance of the depth first search algorithm in supercritical random graphs
- Dot products in \(\mathbb{F}_q^3\) and the Vapnik-Chervonenkis dimension
- Accelerated information dissemination on networks with local and global edges
- Dynamic node packing
- Typical and extremal aspects of friends-and-strangers graphs
- On the coequal values of total chromatic number and chromatic index
- Algorithmic methods for covering arrays of higher index
- Variations on the Erdős distinct-sums problem
- Expansion in supercritical random subgraphs of the hypercube and its consequences
- Progress on local properties problems of difference sets
- Morse subgroups and boundaries of random right-angled Coxeter groups
- Connectivity of friends-and-strangers graphs on random pairs
- On monoid graphs
- A strengthened Orlicz-Pettis theorem via Itô-Nisio
- Digital almost nets
- The covering threshold of a directed acyclic graph by directed acyclic subgraphs
- Distributed algorithms for fractional coloring
- Null models and community detection in multi-layer networks
- \(C_4\)-free subgraphs with large average degree
- Graph clustering via generalized colorings
- On the subspace choosability in graphs
- A clique-free pseudorandom subgraph of the pseudo polarity graph
- Scenery reconstruction for random walk on random scenery systems
- Every Steiner triple system contains almost spanning \(d\)-ary hypertree
- Phase retrieval by binary questions: which complementary subspace is closer?
- Nondegenerate spheres in four dimensions
- Mallows permutations and finite dependence
- On the probability of nonexistence in binomial subsets
- Quantifier alternation in first-order formulas with infinite spectra
- Domination versus edge domination
- System of unbiased representatives for a collection of bicolorings
- Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits
- Four deviations suffice for rank 1 matrices
- Saturation number of Berge stars in random hypergraphs
- Embedding rainbow trees with applications to graph labelling and decomposition
- Geometric and spectral properties of causal maps
This page was built for publication: The probabilistic method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2798999)
