Turán numbers and batch codes
From MaRDI portal
Publication:2345596
DOI10.1016/j.dam.2015.01.006zbMath1311.05137arXiv1309.6506OpenAlexW2067650130WikidataQ59072513 ScholiaQ59072513MaRDI QIDQ2345596
Publication date: 22 May 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.6506
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Information storage and retrieval of data (68P20)
Related Items
Derandomized Construction of Combinatorial Batch Codes ⋮ Erasure combinatorial batch codes based on nonadaptive group testing ⋮ Sparse Hypergraphs with Applications to Coding Theory ⋮ Multiset combinatorial batch codes ⋮ Optimal combinatorial batch codes based on block designs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial batch codes: a lower bound and optimal constructions
- Combinatorial batch codes and transversal matroids
- An extension of the Ruzsa-Szemerédi theorem
- Optimal batch codes: many items or low retrieval requirement
- On an extremal hypergraph problem related to combinatorial batch codes
- On an extremal hypergraph problem of Brown, Erdős and Sós
- On a class of degenerate extremal graph problems
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- An extremal problem for two families of sets
- Combinatorial batch codes
- 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
- Batch codes and their applications
- Extremal graphs with bounded densities of small subgraphs
- Relaxations of Hall’s Condition: Optimal batch codes with multiple queries
- The History of Degenerate (Bipartite) Extremal Graph Problems
- Extensions of Turán's theorem on graphs
