2-cancellative hypergraphs and codes
type: Item
instance of: scholarly article
zbMATH Open document ID: 1238.05267
DOI: 10.1017/S0963548311000563
published in: Combinatorics, Probability and Computing
publication date: 2012-05-14T00:00:00Z
full work available at URL: https://arxiv.org/abs/1103.1934
Mathematics Subject Classification ID: 05D05
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 94B25
zbMATH DE Number: 6034354
zbMATH Keywords: cancellative family of sets
zbMATH Keywords: cancellative hypergraphs
author: Zoltán Füredi
MaRDI profile type: Publication
arXiv ID: 1103.1934
cites work: On a Turán-type hypergraph problem of Brown, Erdős and T. Sós
cites work: Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes
cites work: On the existence of triangulated spheres in 3-graphs, and related problems
cites work: On the upper bound of the size of the \(r\)-cover-free families
cites work: An exact Turán result for the generalized triangle
cites work: Three-graphs without two triples whose symmetric difference is contained in a third
cites work: On an extremal hypergraph problem of Brown, Erdős and Sós
cites work: Q4301239
cites work: String quartets in binary
cites work: On Cancellative Set Families
cites work: Locally thin set families
cites work: Delta-systems and qualitative (in)dependence
cites work: Tracing a single user
cites work: On the extremal combinatorics of the Hamming space
cites work: On a hypergraph Turán problem of Frankl
cites work: Stability theorems for cancellative hypergraphs
cites work: Nonrandom binary superimposed codes
cites work: On upper bounds for unrestricted binary-error-correcting codes
cites work: On \(r\)-cover-free families
cites work: Extremal problems whose solutions are the blowups of the small Witt- designs
cites work: Union-free hypergraphs and probability theory
cites work: Asymptotic solution of a Turán-type problem
cites work: A better bound for locally thin set families
cites work: Combinatorial properties of systems of sets
cites work: On coloring graphs to maximize the proportion of multicolored k-edges
cites work: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
cites work: New rate pairs in the zero-error capacity region of the binary multiplying channel without feedback
cites work: Families of finite sets in which no set is covered by the union of \(r\) others
cites work: Families of finite sets in which no set is covered by the union of two others
cites work: Asymptotic solution of the Turán problem for some hypergraphs
cites work: On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
cites work: An extension of the Ruzsa-Szemerédi theorem
OpenAlex ID: W2063060907
title: 2-cancellative hypergraphs and codes
description: scientific article; zbMATH DE number 6034354