2-Cancellative Hypergraphs and Codes
From MaRDI portal
Publication:2883859
DOI10.1017/S0963548311000563zbMath1238.05267arXiv1103.1934OpenAlexW2063060907MaRDI QIDQ2883859
Publication date: 14 May 2012
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1103.1934
Hypergraphs (05C65) Permutations, words, matrices (05A05) Extremal set theory (05D05) Combinatorial codes (94B25)
Related Items
New Turán Exponents for Two Extremal Hypergraph Problems ⋮ Degenerate Turán densities of sparse hypergraphs
Cites Work
- Unnamed Item
- An extension of the Ruzsa-Szemerédi theorem
- Union-free hypergraphs and probability theory
- Extremal problems whose solutions are the blowups of the small Witt- designs
- Tracing a single user
- On an extremal hypergraph problem of Brown, Erdős and Sós
- An exact Turán result for the generalized triangle
- Families of finite sets in which no set is covered by the union of \(r\) others
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
- Families of finite sets in which no set is covered by the union of two others
- Asymptotic solution of the Turán problem for some hypergraphs
- Three-graphs without two triples whose symmetric difference is contained in a third
- Combinatorial properties of systems of sets
- On the upper bound of the size of the \(r\)-cover-free families
- Stability theorems for cancellative hypergraphs
- On the extremal combinatorics of the Hamming space
- On \(r\)-cover-free families
- Asymptotic solution of a Turán-type problem
- On a hypergraph Turán problem of Frankl
- 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
- String Quartets in Binary
- Locally Thin Set Families
- Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes
- New rate pairs in the zero-error capacity region of the binary multiplying channel without feedback
- Nonrandom binary superimposed codes
- On Cancellative Set Families
- On coloring graphs to maximize the proportion of multicolored k-edges
- On upper bounds for unrestricted binary-error-correcting codes
- Delta-systems and qualitative (in)dependence
- A better bound for locally thin set families
