Extremal combinatorics. With applications in computer science
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1324671
- Extremal and probabilistic combinatorics. Paper from the 28th Brazilian mathematics colloquium -- 28\(^{\text o}\) Colóquio Brasileiro de Matemática, Rio de Janeiro, Brazil, July 2011
- Extremal problems for finite sets
- Extremal Finite Set Theory
- scientific article; zbMATH DE number 686998
Cited in
(only showing first 100 items - show all)- Linear preservers for the \(q\)-permanent, cycle \(q\)-permanent expansions, and positive crossings in digraphs
- Convex geometries are extremal for the generalized Sauer-Shelah bound
- Dioid partitions of groups
- Bayesian-OverDBC: a Bayesian density-based approach for modeling overlapping clusters
- Noncrossing partitions, noncrossing graphs, and q-permanental equations
- On the existence of ordinary triangles
- Colored ray configurations
- Multiplicative complexity of vector valued Boolean functions
- A new decomposition technique for maximal clique enumeration for sparse graphs
- On the number of bases of almost all matroids
- Representability of Lyndon-Maddux relation algebras
- Fractional L-intersecting families
- Optimal fast Johnson-Lindenstrauss embeddings for large data sets
- On the complexity of monotone circuits for threshold symmetric Boolean functions
- On the mutual visibility in Cartesian products and triangle-free graphs
- Correlation bounds for fields and matroids
- On the geography of line arrangements
- Bipartite Hansel results for hypergraphs
- System of unbiased representatives for a collection of bicolorings
- Wide-sense 2-frameproof codes
- On efficiently solvable cases of quantum \(k\)-SAT
- The main eigenvalues of signed graphs
- Uniform forcing and immune sets in graphs and hypergraphs
- Balas formulation for the union of polytopes is optimal
- Daisy cubes and distance cube polynomial
- Computing majority by constant depth majority circuits with low fan-in gates
- From edge-coloring to strong edge-coloring
- Linearized Wenger graphs
- Counting colorings of a regular graph
- A note on the gap between rank and border rank
- Almost difference sets in nonabelian groups
- Cubicity, degeneracy, and crossing number
- Limiting curves for the Pascal adic transformation
- The complexity of binary matrix completion under diameter constraints
- The Turán number of directed paths and oriented cycles
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- Extensions of fractional precolorings show discontinuous behavior
- A shortcut to (sun)flowers: kernels in logarithmic space or linear time
- Extremal and probabilistic combinatorics. Paper from the 28th Brazilian mathematics colloquium -- 28\(^{\text o}\) Colóquio Brasileiro de Matemática, Rio de Janeiro, Brazil, July 2011
- On the path separation number of graphs
- Reducing rank of the adjacency matrix by graph modification
- Reducing rank of the adjacency matrix by graph modification
- Trades in complex Hadamard matrices
- On the number of orientations of random graphs with no directed cycles of a given length
- scientific article; zbMATH DE number 1324671 (Why is no real title available?)
- New applications of the polynomial method: the cap set conjecture and beyond
- Quirky quantifiers: optimal models and complexity of computation tree logic
- On the number of matroids compared to the number of sparse paving matroids
- Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC^0
- On efficiently solvable cases of quantum k-SAT
- Combinatorics in the exterior algebra and the Bollobás two families theorem
- Constructing integer-magic graphs via the combinatorial Nullstellensatz
- Exploiting c-closure in kernelization algorithms for graph problems
- Some open questions about line arrangements in the projective plane
- Approximate Counting of k-Paths: Deterministic and in Polynomial Space
- A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem
- On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs
- A probability perspective to a combinatorics problem
- Algorithmic Polynomials
- Determining majority in networks with local interactions and very small local memory
- Rank vertex cover as a natural problem for algebraic compression
- LONELY RUNNERS IN FUNCTION FIELDS
- Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs
- Erdös-Hajnal properties for powers of sparse graphs
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems
- An Optimal Separation of Randomized and Quantum Query Complexity
- Parameterized complexity of perfectly matched sets
- Immune sets in monotone infection rules. Characterization and complexity
- Size, Depth and Energy of Threshold Circuits Computing Parity Function.
- Competitive Algorithms for Generalized k -Server in Uniform Metrics
- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings
- Bussey systems and Steiner's tactical problem
- Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius
- 2-step nilpotent \(L_{\infty}\)-algebras and hypergraphs
- Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion
- Extension-based constructions of locally repairable fractional repetition codes
- A generalization of diversity for intersecting families
- Phylogenetic diversity indices from an affine and projective viewpoint
- On the size of maximal intersecting families
- Growth rates of the bipartite Erdős-Gyárfás function
- The regular languages of first-order logic with one alternation
- Bi-colored expansions of geometric theories
- Symmetries, graph properties, and quantum speedups
- A new upper bound for codes with a single Hamming distance
- Failed zero forcing numbers of Grassmann graphs
- Resolving sets and split resolving sets of symmetric designs
- Lower bounds for additive complexity of linear operators and bilinear algorithms for matrix and polynomial multiplication over GF(2)
- Minimum bisections of graphs without even cycles
- Linear codes in the folded Hamming distance and the quasi MDS property
- Applications of random algebraic constructions to hardness of approximation
- A combinatorial approach to robust PCA
- On min-bisections of graphs
- Local generation of tilings
- Budgeted matroid maximization: a parameterized viewpoint
- Linear independence over naturally-ordered semirings with applications to dimension arguments in extremal combinatorics
- On ratio-k-cuts of graphs
- Complexity aspects of the extension of Wagner's hierarchy to k-partitions
- Bounds and extremal graphs for the energy of complex unit gain graphs
- Parameterized complexity of perfectly matched sets
- An information theoretic proof of the Chernoff-Hoeffding inequality
This page was built for publication: Extremal combinatorics. With applications in computer science
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3061152)
