scientific article

Publication date: 7 April 2016

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items

Long lines in subsets of large measure in high dimension, The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs, The number of satisfying assignments of random 2‐SAT formulas, Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth, On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices, Color‐biased Hamilton cycles in random graphs, Clique minors in graphs with a forbidden subgraph, Counting extensions revisited, On the clique number of noisy random geometric graphs, Spanning trees with few non-leaves, Site percolation on pseudo‐random graphs, Down‐set thresholds, Hypergraph Ramsey numbers of cliques versus stars, Tuza's conjecture for random graphs, On the minimax spherical designs, Rainbow connectivity and rainbow index of inhomogeneous random graphs, On the extremal function for graph minors, Bipartite-ness under smooth conditions, Supercritical site percolation on the hypercube: small components are small, A bipartite version of the Erdős–McKay conjecture, Largest subgraph from a hereditary property in a random graph, Multivariate correlation inequalities for $P$-partitions, $\log^\ast$-round game-theoretically-fair leader election, Uniform Turán density of cycles, Extremal bipartite independence number and balanced coloring, Unavoidable patterns in complete simple topological graphs, Short proof of the asymptotic confirmation of the Faudree-Lehel conjecture, Extremal results on feedback arc sets in digraphs, Hamilton completion and the path cover number of sparse random graphs, A shape theorem for exploding sandpiles, On finding constrained independent sets in cycles, Some remarks on the Erdős Distinct subset sums problem, Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor, On upper bounds for total k-domination number via the probabilistic method, Towards the Erdős-Hajnal conjecture for $P_5$-free graphs, Exact enumeration of satisfiable 2-SAT formulae, Algorithmic obstructions in the random number partitioning problem, Upper bounds for the constants of Bennett's inequality and the Gale–Berlekamp switching game, Discrepancy of arithmetic progressions in grids, Packing and Covering a Given Directed Graph in a Directed Graph, Experimental study of semi-supervised graph 2-clustering problem, Transversals and colorings of simplicial spheres, On the Gamma-Vector of Symmetric Edge Polytopes, Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions, Simplified Chernoff bounds with powers-of-two probabilities, Long paths in heterogeneous random subgraphs of graphs with large minimum degree, A $7 / 3$-approximation algorithm for feedback vertex set in tournaments via Sherali-Adams, A solution to Erdős and Hajnal’s odd cycle problem, Component behaviour and excess of random bipartite graphs near the critical point, Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022, Asymptotic degree of random monomial ideals, Asynchronous Semianonymous Dynamics over Large-Scale Networks, Sum-distinguishing number of sparse hypergraphs, Threshold for Steiner triple systems, Scale-free graphs with many edges, Brownian snails with removal die out in one dimension, Zip-zip trees: making zip trees more balanced, biased, compact, or persistent, Prevalence of Multistationarity and Absolute Concentration Robustness in Reaction Networks, Towards the Erdős-Gallai cycle decomposition conjecture, New lower bounds for partial k‐parallelisms, Lower bounds for piercing and coloring boxes, Identifying 1-rectifiable measures in Carnot groups, Shuffle squares and reverse shuffle squares, On the Turán number of the hypercube, A critical probability for biclique partition of $G_{n,p}$, The minimum degree removal lemma thresholds, Graph and hypergraph packing, On the limit of the positive $\ell$-degree Turán problem, Discrepancy theory and related algorithms, Spin systems with hyperbolic symmetry: a survey, Rainbow subdivisions of cliques, Coloring lines and Delaunay graphs with respect to boxes, Orthogonal realizations of random sign patterns and other applications of the SIPP, Sparse Semi-Oblivious Routing: Few Random Paths Suffice, Unnamed Item, Null models and community detection in multi-layer networks, On the Complexity of Random Satisfiability Problems with Planted Solutions, $C_4$-free subgraphs with large average degree, Graph clustering via generalized colorings, Constructive Discrepancy Minimization by Walking on the Edges, On the subspace choosability in graphs, A clique-free pseudorandom subgraph of the pseudo polarity graph, Distance Ramsey numbers, Scenery reconstruction for random walk on random scenery systems, Probabilistic combinatorics and the recent work of Peter Keevash, Every Steiner triple system contains almost spanning $d$-ary hypertree, Unnamed Item, Phase retrieval by binary questions: which complementary subspace is closer?, Nondegenerate spheres in four dimensions, Uniquely $D$-colourable digraphs with large girth. II: Simplification via generalization, Nested linear/lattice codes revisited, Random spanning forests and hyperbolic symmetry, Inverse problems for minimal complements and maximal supplements, Forbidding $K_{2,t}$ traces in triple systems, On the $s$-colorful number of a random hypergraph, Triangle resilience of the square of a Hamilton cycle in random graphs, Number of directions determined by a set in $\mathbb{F}_q^2$ and growth in $\mathrm{Aff}(\mathbb{F}_q)$, Splits with forbidden subgraphs, On sensitivity in bipartite Cayley graphs, Discrepancies of spanning trees and Hamilton cycles, The runsort permuton, Mallows permutations and finite dependence, On the probability of nonexistence in binomial subsets, The duality gap for two-team zero-sum games, Generalized Sidon sets of perfect powers, Nonlinear aspects of super weakly compact sets, On the average size of independent sets in triangle-free graphs, Deterministic non-adaptive contention resolution on a shared channel, Two lower bounds for $p$-centered colorings, Quantifier alternation in first-order formulas with infinite spectra, Distinct degrees and homogeneous sets, Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs, SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS, Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback, Counting dope matrices, Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation, Domination versus edge domination, Threshold functions for incidence properties in finite vector spaces, Concentration of rainbow $k$-connectivity of a multiplex random graph, On zero-sum free sequences contained in random subsets of finite cyclic groups, System of unbiased representatives for a collection of bicolorings, Finding and Using Expanders in Locally Sparse Graphs, Moser-Tardos resampling algorithm, entropy compression method and the subset gas, Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits, Sign rank versus Vapnik-Chervonenkis dimension, 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, Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs, Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs, Random bipartite posets and extremal problems, Sum-Free Sets of Integers with a Forbidden Sum, Blowup Ramsey numbers, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Induced Universal Hypergraphs, Random walks and concurrent zero-knowledge, Universal arrays, Kneser Ranks of Random Graphs and Minimum Difference Representations, Zero-one laws for random distance graphs with vertices in $\{0,1\}^n$, Unnamed Item, Bifurcations in the Kuramoto model on graphs, Ramsey numbers of Berge-hypergraphs and related structures, Stability versions of Erdős-Ko-Rado type theorems via isoperimetry, If (A+A)/(A+A) is small, then the ratio set is large, Induced acyclic tournaments in random digraphs: sharp concentration, thresholds and algorithms, Time-varying network models, Co-degrees resilience for perfect matchings in random hypergraphs, Cooperative colorings of trees and of bipartite graphs, An Upper Bound on the Sizes of Multiset-Union-Free Families, Phase Transitions in Discrete Structures, Traces of hypergraphs, Degenerate Turán densities of sparse hypergraphs, Using Ramsey theory to measure unavoidable spurious correlations in big data, Rank-deficient representations in the theta correspondence over finite fields arise from quantum codes, The number of independent sets in an irregular graph, Goldberg's conjecture is true for random multigraphs, Small simplicial complexes with prescribed torsion in homology, A Proof of Brouwer's Toughness Conjecture, On long words avoiding Zimin patterns, A note on the minimum number of edges in hypergraphs with property O, Large cliques and independent sets all over the place, Edge-statistics on large graphs, Colouring set families without monochromatic $k$-chains, A polynomial-time approximation scheme for the airplane refueling problem, A constructive solution to a problem of ranking tournaments, Tournaments and Semicomplete Digraphs, On small $n$-uniform hypergraphs with positive discrepancy, Random matrices: universality of local spectral statistics of non-Hermitian matrices, Consistency of spectral clustering in stochastic block models, 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, Complexity of equilibrium in competitive diffusion games on social networks, Asymmetric list sizes in bipartite graphs, Tight multiple twins in permutations, Random numerical semigroups and a simplicial complex of irreducible semigroups, Determinantal probability measures, Random monomial ideals, The $(k,\ell)$-rainbow index for complete bipartite and multipartite graphs, Tough Ramsey graphs without short cycles, Approximability of maximum splitting of k-sets and some other Apx-complete problems, Ramsey-nice families of graphs, 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, How unproportional must a graph be?, Ultimate data hiding in quantum mechanics and beyond, The weak zero-one laws for the random distance graphs, Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions, Efficient PRAM simulation on a distributed memory machine, Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles, Extension of the zero-one $k$-law, Monochromatic paths in random tournaments, 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, Unbounded-error quantum query complexity, Zero-one laws for first-order formulas with a bounded quantifier depth, On two-colorings of hypergraphs, Approximating a convex body by a polytope using the epsilon-net theorem, On the sum of $k$ largest distance eigenvalues of graphs, Independent sets in the union of two Hamiltonian cycles, Lower bounds for the number of hyperplanes separating two finite sets of points, Sandpiles on the square lattice, On difference graphs and the local dimension of posets, New bounds on Simonyi's conjecture, Small subgraphs in the trace of a random walk, On generalized Stanley sequences, A large deviation principle for the Erdős-Rényi uniform random graph, A moment-generating formula for Erdős-Rényi component sizes, Representability of Lyndon-Maddux relation algebras, Paths and cycles in random subgraphs of graphs with large minimum degree, Asymptotically optimal induced universal graphs, On the realization of random graphs as distance graphs in spaces of fixed dimension, Distance graphs with large chromatic numbers and small clique numbers, Cycles of given lengths in unicyclic components in sparse random graphs, The $(k,\ell )$-proper index of graphs, The central limit theorem for supercritical oriented percolation in two dimensions, Covering triangles in edge-weighted graphs, An improved bound on $(A+A)/(A+A)$, 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, Near-perfect clique-factors in sparse pseudorandom 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, A graph coloring problem, 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, Some results on $(a:b)$-choosability, 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, Distinct distances in planar point sets with forbidden 4-point patterns, The hat guessing number of graphs, Matchings and independent sets of a fixed size in regular graphs, Real-time error correction codes for deletable errors, Cliques and chromatic number in multiregime random graphs, On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering, Analyticity for rapidly determined properties of Poisson Galton-Watson trees, 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, Packing of partial designs, Structured Codes of Graphs, The Weighted Davenport Constant of a group and a related extremal problem, Popular progression differences in vector spaces II, The role of the p-value in the multitesting problem, Irregular subgraphs, Card guessing with partial feedback, Continuous phase transitions on Galton–Watson trees, The Hardy-Littlewood Inequalities in Sequence Spaces, The valence of harmonic polynomials viewed through the probabilistic lens, Discrepancy in modular arithmetic progressions, Subgraphs of Kneser graphs with large girth and large chromatic number, Unnamed Item, Characteristic Dependence of Syzygies of Random Monomial Ideals, Complete Minors in Graphs Without Sparse Cuts, Edge Deletion Algorithms for Minimizing Spread in SIR Epidemic Models, The 8-rank of the narrow class group and the negative Pell equation, Spanning Trees at the Connectivity Threshold, Rainbow Perfect Matchings for 4-Uniform Hypergraphs, On (Valiant’s) Polynomial-Size Monotone Formula for Majority, The cross-product conjecture for width two posets, Counting colorings of triangle-free graphs, Equal sums in random sets and the concentration of divisors, Effective Poset Inequalities, Tower Gaps in Multicolour Ramsey Numbers, Weak degeneracy of graphs, The mod k $k$ chromatic index of random graphs, Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture, Octopuses in the Boolean cube: families with pairwise small intersections. I, On 3‐graphs with no four vertices spanning exactly two edges, The intersection spectrum of 3‐chromatic intersecting hypergraphs, Friendly bisections of random graphs, Doubly random polytopes, The largest hole in sparse random graphs, Finding any given 2‐factor in sparse pseudorandom graphs efficiently, New bounds on the maximum number of neighborly boxes in $\mathbb{R}^d$, The list linear arboricity of graphs, A random graph model for clustering graphs, On asymptotic packing of convex geometric and ordered graphs, A post-quantum associative memory, Deterministic Massively Parallel Connectivity, Private simultaneous messages based on quadratic residues, A Result on Polynomials Derived Via Graph Theory, The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘), Extremal problems in hypergraph colourings, Unnamed Item, Unnamed Item, Unnamed Item, First-order zero-one law for the uniform model of the random graph, Counting restricted orientations of random graphs, Local optima of the Sherrington-Kirkpatrick Hamiltonian, Sparse Hypergraphs with Applications to Coding Theory, Upper Tail Bounds for Cycles, The spectrum of the abelian sandpile model, The Genus of a Random Bipartite Graph, New Turán Exponents for Two Extremal Hypergraph Problems, The minrank of random graphs, Non-concentration of the chromatic number of a random graph, Phase transition in random contingency tables with non-uniform margins, Relative Turán Problems for Uniform Hypergraphs, Repeated Patterns in Proper Colorings, Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs, Near-perfect clique-factors in sparse pseudorandom graphs, On the $AC^0$ Complexity of Subgraph Isomorphism, Unnamed Item, Unnamed Item, Unnamed Item, Packing Paths in Steiner Triple Systems, Induced Ramsey-type results and binary predicates for point sets, Size Ramsey number of bipartite graphs and bipartite Ramanujan graphs, Simple and local independent set approximation, Packing random intervals, Simple juntas for shifted families, Avoiding Multiple Repetitions in Euclidean Spaces, Local Properties via Color Energy Graphs and Forbidden Configurations, Realization problems on reachability sequences, Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction, A tight approximation algorithm for the cluster vertex deletion problem, Plane and planarity thresholds for random geometric graphs, The descriptive complexity of subgraph isomorphism without numerics, Expanders with respect to Hadamard spaces and random graphs, An efficient container lemma, Unnamed Item, On the Size-Ramsey Number of Cycles, Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles, Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set, Optimal threshold for a random graph to be 2-universal, An extension of the Erdős‐Tetali theorem, Proof of a conjecture on induced subgraphs of Ramsey graphs, An approximate version of Jackson’s conjecture, Dirac’s theorem for random regular graphs, Tower-type bounds for unavoidable patterns in words, All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor-{k}+1$ Disjoint ${k}$-Cliques (and This Is Tight), Large Induced Matchings in Random Graphs, A Note on the Erdös Distinct Subset Sums Problem, Topology of random -dimensional cubical complexes, Hitting times for Shamir’s problem, Ramsey Numbers for Nontrivial Berge Cycles, Constructing Partial MDS Codes from Reducible Algebraic Curves, Zero-one laws for random graphs with vertices in a Boolean cube