Extremal uncrowded hypergraphs
From MaRDI portal
Publication:1164072
DOI10.1016/0097-3165(82)90049-8zbMath0485.05049OpenAlexW2071474047WikidataQ105583589 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
Independence in uniform linear triangle-free hypergraphs, Additive combinatorics and graph theory, Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs, Probabilistic methods, Fractional v. integral covers in hypergraphs of bounded edge size, Point sets with distinct distances, Large triangles in the \(d\)-dimensional unit cube, 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, Generalizations of Heilbronn's Triangle Problem, Graph and hypergraph colouring via nibble methods: a survey, A proof of the Erdős-Faber-Lovász conjecture, Coloring unions of nearly disjoint hypergraph cliques, Distributions of points in the unit square and large \(k\)-gons, No l Grid-Points in Spaces of Small Dimension, Extremal problems in hypergraph colourings, Infinite Sidon Sets Contained in Sparse Random Sets of Integers, Unnamed Item, Sparse hypergraphs with low independence number, Access balancing in storage systems by labeling partial Steiner systems, Sparse Hypergraphs with Applications to Coding Theory, A note on improved upper bounds on the transversal number of hypergraphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, A note on the independence number of triangle-free graphs. II, 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, On the Independence Number of Steiner Systems, On independent sets in hypergraphs, On the chromatic number of set systems, Distributions of points in \(d\) dimensions and large \(k\) -point simplices, The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers, On uncrowded hypergraphs, Point sets in the unit square and large areas of convex hulls of subsets of points, A note on the random greedy independent set algorithm, On the independence number of non-uniform uncrowded hypergraphs, Generalizations of Heilbronn's triangle problem, Counting Independent Sets in Hypergraphs, On Erdős-Rado numbers
Cites Work
