The following pages link to Extremal Combinatorics (Q3061152):
Displaying 45 items.
- On the path separation number of graphs (Q313786) (← links)
- Reducing rank of the adjacency matrix by graph modification (Q344771) (← links)
- On the number of orientations of random graphs with no directed cycles of a given length (Q405150) (← links)
- On the number of matroids compared to the number of sparse paving matroids (Q491548) (← links)
- Determining majority in networks with local interactions and very small local memory (Q518677) (← links)
- Rank reduction of oriented graphs by vertex and edge deletions (Q722520) (← links)
- Partial covering arrays: algorithms and asymptotics (Q726106) (← links)
- Exploiting hidden structure in selecting dimensions that distinguish vectors (Q899584) (← links)
- Linear preservers for the \(q\)-permanent, cycle \(q\)-permanent expansions, and positive crossings in digraphs (Q1630064) (← links)
- Convex geometries are extremal for the generalized Sauer-Shelah bound (Q1640207) (← links)
- Dioid partitions of groups (Q1663807) (← links)
- Bayesian-OverDBC: a Bayesian density-based approach for modeling overlapping clusters (Q1664908) (← links)
- Noncrossing partitions, noncrossing graphs, and \(q\)-permanental equations (Q1690673) (← links)
- On the existence of ordinary triangles (Q1693316) (← links)
- Colored ray configurations (Q1699300) (← links)
- Multiplicative complexity of vector valued Boolean functions (Q1704580) (← links)
- A new decomposition technique for maximal clique enumeration for sparse graphs (Q1740688) (← links)
- On the number of bases of almost all matroids (Q1786054) (← links)
- Representability of Lyndon-Maddux relation algebras (Q1991584) (← links)
- Fractional \(L\)-intersecting families (Q2001971) (← links)
- Optimal fast Johnson-Lindenstrauss embeddings for large data sets (Q2059797) (← links)
- On the complexity of monotone circuits for threshold symmetric Boolean functions (Q2064376) (← links)
- On the mutual visibility in Cartesian products and triangle-free graphs (Q2096353) (← links)
- Correlation bounds for fields and matroids (Q2119388) (← links)
- On the geography of line arrangements (Q2127865) (← links)
- Bipartite Hansel results for hypergraphs (Q2198970) (← links)
- System of unbiased representatives for a collection of bicolorings (Q2201776) (← links)
- Wide-sense 2-frameproof codes (Q2211333) (← links)
- On efficiently solvable cases of quantum \(k\)-SAT (Q2223725) (← links)
- Limiting curves for the Pascal adic transformation (Q2628957) (← links)
- (Q5005139) (← links)
- Combinatorics in the exterior algebra and the Bollobás Two Families Theorem (Q5034136) (← links)
- Constructing integer-magic graphs via the Combinatorial Nullstellensatz (Q5045258) (← links)
- Some open questions about line arrangements in the projective plane (Q5080957) (← links)
- Approximate Counting of k-Paths: Deterministic and in Polynomial Space (Q5091173) (← links)
- A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem (Q5091240) (← links)
- On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs (Q5103874) (← links)
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
- Parameterized complexity of perfectly matched sets (Q6038698) (← links)
- Immune sets in monotone infection rules. Characterization and complexity (Q6064851) (← links)
- Size, Depth and Energy of Threshold Circuits Computing Parity Function. (Q6065463) (← links)
- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings (Q6131199) (← links)
- Bussey systems and Steiner's tactical problem (Q6146845) (← links)
- Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius (Q6156027) (← links)
- 2-step nilpotent \(L_{\infty}\)-algebras and hypergraphs (Q6199058) (← links)
