Extremal uncrowded hypergraphs
From MaRDI portal
Publication:1164072
DOI10.1016/0097-3165(82)90049-8zbMath0485.05049WikidataQ105583589 ScholiaQ105583589MaRDI QIDQ1164072
Miklós Ajtai, Endre Szemerédi, János Pintz, J. H. Spencer, János Komlós
Publication date: 1982
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(82)90049-8
Related Items
Infinite Sidon Sets Contained in Sparse Random Sets of Integers, A note on improved upper bounds on the transversal number of hypergraphs, On uncrowded hypergraphs, On the Independence Number of Steiner Systems, Extremal problems in hypergraph colourings, Sparse Hypergraphs with Applications to Coding Theory, The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers, On independent sets in hypergraphs, Counting Independent Sets in Hypergraphs, Unnamed Item, Independent sets in hypergraphs omitting an intersection, Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth, Heilbronn triangle‐type problems in the unit square [0,12], Independence number of hypergraphs under degree conditions, Graph and hypergraph colouring via nibble methods: a survey, A proof of the Erdős-Faber-Lovász conjecture, Independence in uniform linear triangle-free hypergraphs, Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs, On the independence number of non-uniform uncrowded hypergraphs, Large triangles in the \(d\)-dimensional unit cube, Distributions of points in \(d\) dimensions and large \(k\) -point simplices, Point sets in the unit square and large areas of convex hulls of subsets of points, Generalizations of Heilbronn's triangle problem, Probabilistic methods, A note on the independence number of triangle-free graphs. II, Fractional v. integral covers in hypergraphs of bounded edge size, Additive combinatorics and graph theory, Sparse hypergraphs with low independence number, On Erdős-Rado numbers, Point sets with distinct distances, Access balancing in storage systems by labeling partial Steiner systems, On the number of independent sets in uniform, regular, linear hypergraphs, New bounds on the field size for maximally recoverable codes instantiating grid-like topologies, Distributions of points in the unit square and large \(k\)-gons, On the chromatic number of set systems, A note on the random greedy independent set algorithm, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Generalizations of Heilbronn's Triangle Problem, No l Grid-Points in Spaces of Small Dimension
Cites Work
