Uniform hypergraphs containing no grids
From MaRDI portal
Publication:390731
DOI10.1016/j.aim.2013.03.009zbMath1278.05161arXiv1103.1691MaRDI QIDQ390731
Miklós Ruszinkó, Zoltan Fueredi
Publication date: 8 January 2014
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1103.1691
05C65: Hypergraphs
05D05: Extremal set theory
11B25: Arithmetic progressions
05C42: Density (toughness, etc.)
Related Items
A Ramsey variant of the Brown–Erdős–Sós conjecture, Sparse Hypergraphs with Applications to Coding Theory, New Turán Exponents for Two Extremal Hypergraph Problems, Constructing dense grid-free linear $3$-graphs, Separating Hash Families: A Johnson-type bound and New Constructions, Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity, The Turán number of the grid, On vertex independence number of uniform hypergraphs, The linear Turán number of small triple systems or why is the wicket interesting?, On a conjecture of Erdős on locally sparse Steiner triple systems, Sparse hypergraphs: new bounds and constructions, Turán and Ramsey numbers in linear triple systems, Degenerate Turán densities of sparse hypergraphs, Identifying defective sets using queries of small size, On positive hypergraphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An extension of the Ruzsa-Szemerédi theorem
- A new extremal property of Steiner triple-systems
- Tracing a single user
- On 6-sparse Steiner triple systems
- On an extremal hypergraph problem of Brown, Erdős and Sós
- The existence of 5-sparse Steiner triple systems of order \(n \equiv 3 \mod 6\), \(n \notin \{9,15 \}\)
- Further 6-sparse Steiner triple systems
- Sidon sets in groups and induced subgraphs of Cayley graphs
- Families of finite sets in which no set is covered by the union of \(r\) others
- Union-free families of sets and equations over fields
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- Exact solution of some Turán-type problems
- Families of finite sets in which no set is covered by the union of two others
- On the upper bound of the size of the \(r\)-cover-free families
- Anti-mitre Steiner triple systems
- A simple construction of \(d\)-disjunct matrices with certain constant weights
- Packing graphs: The packing problem solved
- Compactness results in extremal graph theory
- On \(r\)-cover-free families
- On extremal problems of graphs and generalized graphs
- An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
- On the existence of triangulated spheres in 3-graphs, and related problems
- On a Turán-type hypergraph problem of Brown, Erdős and T. Sós
- 5-sparse Steiner triple systems of order \(n\) exist for almost all admissible \(n\)
- Integer sets containing no arithmetic progressions
- Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes
- Tracing Many Users With Almost No Rate Penalty
- Integer Sets Containing No Arithmetic Progressions
- Superimposed codes in R/sup n/
- On sets of integers containing k elements in arithmetic progression
- A direct product construction for 5-sparse triple systems
- Solving a linear equation in a set of integers I
- On optimal superimposed codes
- Construction Techniques for Anti-Pasch Steiner Triple Systems
- An improved upper bound of the rate of Euclidean superimposed codes
- Improved asymptotic bounds for error-correcting codes
- Nonrandom binary superimposed codes
- Some new results on superimposed codes
- The resolution of the anti‐mitre Steiner triple system conjecture
- Infinite classes of anti‐mitre and 5‐sparse Steiner triple systems
- Behrend-type constructions for sets of linear equations
- On Graphs that do not Contain a Thomsen Graph
- On upper bounds for unrestricted binary-error-correcting codes
- A Method for Detecting All Defective Members in a Population by Group Testing
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- Primes in short intervals
- Optimal superimposed codes and designs for Renyi's search model
