On a combinatorial conjecture of Erdös
From MaRDI portal
Publication:5526135
DOI10.1016/S0021-9800(66)80027-3zbMath0148.01105OpenAlexW2047370658WikidataQ123151054 ScholiaQ123151054MaRDI QIDQ5526135
Publication date: 1966
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0021-9800(66)80027-3
Related Items
A Helly Theorem for Sets, The maximum product of sizes of cross-intersecting families, Structured Codes of Graphs, Probabilities for Intersecting Systems and Random Subsets of Finite Sets, Intersection theorems under dimension constraints, Probabilistic methods, Codes with given distances, Pairwise intersections and forbidden configurations, The \(b\)-chromatic number of powers of hypercube, Models of multi-user write-efficient memories and general diametric theorems, Some intersection theorems for ordered sets and graphs, A stability result for the Katona theorem, A uniform version of a theorem by Dvir and Moran, Constructive bounds for a Ramsey-type problem, On Polynomials with Low Peak Signal to Power (L ∞ to L 2 Norm) Ratios and Theorems of Kashin and Spencer, Radius and diameter in Manhattan lattices, The structure of popular difference sets, A non-uniform Littlewood-Offord inequality, Quantitative invertibility of random matrices: a combinatorial perspective, New bounds on the maximum number of neighborly boxes in \(\mathbb{R}^d\), The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs, Independence numbers of Johnson-type graphs, On Vietoris–Rips Complexes (with Scale 3) of Hypercube Graphs, Exact values and improved bounds on \(k\)-neighborly families of boxes, A Stability Result for Families with Fixed Diameter, Diameter and radius in the Manhattan metric, Discrepancy in arithmetic progressions, Extremal problems under dimension constraints., A Diametric Theorem in ${\mathbb Z}^n_m$ for Lee and Related Distances, Six Standard Deviations Suffice, Difference sets and positive exponential sums. I: General properties, On Motzkin's problem in the circle group, The clique distribution in powers of hypercubes, The edge-diametric theorem in Hamming spaces, On metric properties of maps between Hamming spaces and related graph homomorphisms, Diametric theorems in sequence spaces, The construction of a set of recurrence which is not a set of strong recurrence, On robust colorings of Hamming-distance graphs, On small graphs with highly imperfect powers, On \(b\)-coloring of powers of hypercubes, Some Erdős-Ko-Rado theorems for injections, Refuting conjectures in extremal combinatorics via linear programming, Erdös–Ko–Rado Theorem—22 Years Later, Extremal problems among subsets of a set. (Reprint), A nonuniform Littlewood-Offord inequality for all norms, On the maximum number of permutations with given maximal or minimal distance, Contributions to the geometry of Hamming spaces, The maximum sum and the maximum product of sizes of cross-intersecting families, Strongly intersecting integer partitions, The diametric theorem in Hamming spaces---optimal anticodes, On \(t\)-intersecting families of signed sets and permutations, VC dimension and a union theorem for set systems, Edge-isoperimetric inequalities and ball-noise stability: linear programming and probabilistic approaches, The Erdös-Ko-Rado Theorem for Integer Sequences, Extremal problems among subsets of a set, More on the Erdős-Ko-Rado theorem for integer sequences, A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets, The Edge-Diametric Theorem in Hamming Spaces, Maximal sets of given diameter in the grid and the torus, Algorithmic Aspects of Combinatorial Discrepancy
