Pages that link to "Item:Q5526135"
From MaRDI portal
The following pages link to On a combinatorial conjecture of Erdös (Q5526135):
Displaying 50 items.
- The \(b\)-chromatic number of powers of hypercube (Q327695) (← links)
- A stability result for the Katona theorem (Q345134) (← links)
- Difference sets and positive exponential sums. I: General properties (Q485211) (← links)
- On metric properties of maps between Hamming spaces and related graph homomorphisms (Q507807) (← links)
- On \(b\)-coloring of powers of hypercubes (Q528557) (← links)
- The structure of popular difference sets (Q607857) (← links)
- Strongly intersecting integer partitions (Q740661) (← links)
- More on the Erdős-Ko-Rado theorem for integer sequences (Q793729) (← links)
- Pairwise intersections and forbidden configurations (Q850074) (← links)
- Diameter and radius in the Manhattan metric (Q910716) (← links)
- The edge-diametric theorem in Hamming spaces (Q947095) (← links)
- Some Erdős-Ko-Rado theorems for injections (Q966141) (← links)
- On \(t\)-intersecting families of signed sets and permutations (Q1025955) (← links)
- Probabilistic methods (Q1091406) (← links)
- Codes with given distances (Q1094390) (← links)
- Some intersection theorems for ordered sets and graphs (Q1109031) (← links)
- Radius and diameter in Manhattan lattices (Q1121887) (← links)
- Diametric theorems in sequence spaces (Q1193528) (← links)
- The construction of a set of recurrence which is not a set of strong recurrence (Q1196336) (← links)
- On small graphs with highly imperfect powers (Q1198509) (← links)
- On the maximum number of permutations with given maximal or minimal distance (Q1235702) (← links)
- Contributions to the geometry of Hamming spaces (Q1242920) (← links)
- The diametric theorem in Hamming spaces---optimal anticodes (Q1271885) (← links)
- Maximal sets of given diameter in the grid and the torus (Q1313846) (← links)
- Models of multi-user write-efficient memories and general diametric theorems (Q1363782) (← links)
- Constructive bounds for a Ramsey-type problem (Q1376057) (← links)
- Extremal problems under dimension constraints. (Q1417564) (← links)
- Extremal problems among subsets of a set (Q1843567) (← links)
- On robust colorings of Hamming-distance graphs (Q1991409) (← links)
- Refuting conjectures in extremal combinatorics via linear programming (Q2010628) (← links)
- A nonuniform Littlewood-Offord inequality for all norms (Q2022155) (← links)
- Edge-isoperimetric inequalities and ball-noise stability: linear programming and probabilistic approaches (Q2077268) (← links)
- A uniform version of a theorem by Dvir and Moran (Q2166116) (← links)
- A non-uniform Littlewood-Offord inequality (Q2182212) (← links)
- On Motzkin's problem in the circle group (Q2234362) (← links)
- The clique distribution in powers of hypercubes (Q2235258) (← links)
- VC dimension and a union theorem for set systems (Q2315444) (← links)
- A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets (Q2346594) (← links)
- The maximum product of sizes of cross-intersecting families (Q2359973) (← links)
- Intersection theorems under dimension constraints (Q2368655) (← links)
- Extremal problems among subsets of a set. (Reprint) (Q2497992) (← links)
- The maximum sum and the maximum product of sizes of cross-intersecting families (Q2509742) (← links)
- Erdös–Ko–Rado Theorem—22 Years Later (Q3041202) (← links)
- Quantitative invertibility of random matrices: a combinatorial perspective (Q3382245) (← links)
- The Edge-Diametric Theorem in Hamming Spaces (Q3439257) (← links)
- A Diametric Theorem in ${\mathbb Z}^n_m$ for Lee and Related Distances (Q3540915) (← links)
- Six Standard Deviations Suffice (Q3698810) (← links)
- Probabilities for Intersecting Systems and Random Subsets of Finite Sets (Q3704664) (← links)
- A Helly Theorem for Sets (Q3963009) (← links)
- On Polynomials with Low Peak Signal to Power (<i>L</i> <sub>∞</sub> to <i>L</i> <sub>2</sub> Norm) Ratios and Theorems of Kashin and Spencer (Q4012599) (← links)
