Extremal Combinatorics
From MaRDI portal
Publication:3061152
DOI10.1007/978-3-642-17364-6zbMath1239.05001OpenAlexW4212992501MaRDI QIDQ3061152
Publication date: 14 December 2010
Published in: Texts in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-17364-6
combinatoricsRamsey theoryextremal set theorycommunication complexityspectral graph theorypolynomial methodlinear algebra methodprobablistic method
Extremal set theory (05D05) Ramsey theory (05D10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (75)
Correlation bounds for fields and matroids ⋮ Combinatorics in the exterior algebra and the Bollobás Two Families Theorem ⋮ On the geography of line arrangements ⋮ An Optimal Separation of Randomized and Quantum Query Complexity ⋮ Constructing integer-magic graphs via the Combinatorial Nullstellensatz ⋮ Linear preservers for the \(q\)-permanent, cycle \(q\)-permanent expansions, and positive crossings in digraphs ⋮ Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems ⋮ Limiting curves for the Pascal adic transformation ⋮ On the path separation number of graphs ⋮ Convex geometries are extremal for the generalized Sauer-Shelah bound ⋮ Trades in Complex Hadamard Matrices ⋮ Reducing rank of the adjacency matrix by graph modification ⋮ New applications of the polynomial method: The cap set conjecture and beyond ⋮ Reducing Rank of the Adjacency Matrix by Graph Modification ⋮ A note on the gap between rank and border rank ⋮ Dioid partitions of groups ⋮ Some open questions about line arrangements in the projective plane ⋮ Bayesian-OverDBC: a Bayesian density-based approach for modeling overlapping clusters ⋮ A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time ⋮ Almost difference sets in nonabelian groups ⋮ Parameterized complexity of perfectly matched sets ⋮ Immune sets in monotone infection rules. Characterization and complexity ⋮ The complexity of binary matrix completion under diameter constraints ⋮ On the number of orientations of random graphs with no directed cycles of a given length ⋮ Competitive Algorithms for Generalized k -Server in Uniform Metrics ⋮ Noncrossing partitions, noncrossing graphs, and \(q\)-permanental equations ⋮ A Probability Perspective to a Combinatorics Problem ⋮ On the existence of ordinary triangles ⋮ Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings ⋮ Exploiting hidden structure in selecting dimensions that distinguish vectors ⋮ Bussey systems and Steiner's tactical problem ⋮ Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius ⋮ Bipartite Hansel results for hypergraphs ⋮ Colored ray configurations ⋮ Unnamed Item ⋮ 2-step nilpotent \(L_{\infty}\)-algebras and hypergraphs ⋮ Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion ⋮ System of unbiased representatives for a collection of bicolorings ⋮ Multiplicative complexity of vector valued Boolean functions ⋮ The Turán number of directed paths and oriented cycles ⋮ Wide-sense 2-frameproof codes ⋮ LONELY RUNNERS IN FUNCTION FIELDS ⋮ On efficiently solvable cases of quantum \(k\)-SAT ⋮ Algorithmic Polynomials ⋮ The main eigenvalues of signed graphs ⋮ On the number of matroids compared to the number of sparse paving matroids ⋮ Exploiting c-Closure in Kernelization Algorithms for Graph Problems ⋮ Uniform forcing and immune sets in graphs and hypergraphs ⋮ Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic ⋮ A new decomposition technique for maximal clique enumeration for sparse graphs ⋮ Size, Depth and Energy of Threshold Circuits Computing Parity Function. ⋮ Representability of Lyndon-Maddux relation algebras ⋮ Determining majority in networks with local interactions and very small local memory ⋮ Fractional \(L\)-intersecting families ⋮ On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs ⋮ Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs ⋮ Rank reduction of oriented graphs by vertex and edge deletions ⋮ On the number of bases of almost all matroids ⋮ Partial covering arrays: algorithms and asymptotics ⋮ Cubicity, degeneracy, and crossing number ⋮ Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$ ⋮ Balas formulation for the union of polytopes is optimal ⋮ Optimal fast Johnson-Lindenstrauss embeddings for large data sets ⋮ Daisy cubes and distance cube polynomial ⋮ Approximate Counting of k-Paths: Deterministic and in Polynomial Space ⋮ A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem ⋮ On the complexity of monotone circuits for threshold symmetric Boolean functions ⋮ Rank Vertex Cover as a Natural Problem for Algebraic Compression ⋮ Computing majority by constant depth majority circuits with low fan-in gates ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ Erdös--Hajnal Properties for Powers of Sparse Graphs ⋮ On the mutual visibility in Cartesian products and triangle-free graphs ⋮ From edge-coloring to strong edge-coloring ⋮ Linearized Wenger graphs ⋮ Counting colorings of a regular graph
This page was built for publication: Extremal Combinatorics
