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 (only showing first 100 items - show all)

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 ⋮ Towards the Erdős-Gallai cycle decomposition conjecture ⋮ Probabilistic hypergraph containers ⋮ Generalized Tuza's conjecture for random hypergraphs ⋮ Local rainbow colorings for various graphs ⋮ New bounds for the same-type lemma ⋮ On minimal coverings and pairwise generation of some primitive groups of wreath product type ⋮ Discursive voter models on the supercritical scale-free network ⋮ Max-consensus of multi-agent systems in random networks ⋮ Log-concave poset inequalities ⋮ Subdivisions in dicritical digraphs with large order or digirth ⋮ New bounds on the generalized Ramsey number \(f(n, 5, 8)\) ⋮ Coprime networks of the composite numbers: pseudo-randomness and synchronizability ⋮ On round-robin tournaments with a unique maximum score ⋮ Regular decomposition of the edge set of a graph with applications ⋮ Separating path systems of almost linear size ⋮ Erratum to: ``Multitasking capacity: hardness results and improved constructions ⋮ On the size distribution of the fixed-length Levenshtein balls with radius one ⋮ The growth rate of multicolor Ramsey numbers of 3-graphs ⋮ On maximal Roman domination in graphs: complexity and algorithms ⋮ Cliques, chromatic number, and independent sets in the semi-random process ⋮ On connectivity in random graph models with limited dependencies ⋮ Leveraging parameterized Chernoff bounds for simplified algorithm analyses ⋮ A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems ⋮ The intersection spectrum of 3-chromatic intersecting hypergraphs ⋮ Characterizations of \(B\)-valued concentration inequalities via the Rademacher type

This page was built for publication: