2-Cancellative Hypergraphs and Codes (Q2883859)

From MaRDI portal

Revision as of 09:57, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use this page instead for the normal view: 2-Cancellative Hypergraphs and Codes

scientific article

Language	Label	Description	Also known as
English	2-Cancellative Hypergraphs and Codes	scientific article

Statements

scholarly article

0 references

2-Cancellative Hypergraphs and Codes (English)

0 references

Combinatorics, Probability and Computing

0 references

publication date

14 May 2012

0 references

full work available at URL

https://arxiv.org/abs/1103.1934

0 references

zbMATH Keywords

cancellative family of sets

0 references

cancellative hypergraphs

0 references

0 references

MaRDI profile type

0 references

On a Turán-type hypergraph problem of Brown, Erdős and T. Sós

0 references

Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes

0 references

On the existence of triangulated spheres in 3-graphs, and related problems

0 references

On the upper bound of the size of the \(r\)-cover-free families

0 references

An exact Turán result for the generalized triangle

0 references

Three-graphs without two triples whose symmetric difference is contained in a third

0 references

On an extremal hypergraph problem of Brown, Erdős and Sós

0 references

0 references

String Quartets in Binary

0 references

On Cancellative Set Families

0 references

Locally Thin Set Families

0 references

Delta-systems and qualitative (in)dependence

0 references

Tracing a single user

0 references

On the extremal combinatorics of the Hamming space

0 references

On a hypergraph Turán problem of Frankl

0 references

Stability theorems for cancellative hypergraphs

0 references

Nonrandom binary superimposed codes

0 references

On upper bounds for unrestricted binary-error-correcting codes

0 references

On \(r\)-cover-free families

0 references

Extremal problems whose solutions are the blowups of the small Witt- designs

0 references

Union-free hypergraphs and probability theory

0 references

Asymptotic solution of a Turán-type problem

0 references

A better bound for locally thin set families

0 references

Combinatorial properties of systems of sets

0 references

On coloring graphs to maximize the proportion of multicolored k-edges

0 references

The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent

0 references

New rate pairs in the zero-error capacity region of the binary multiplying channel without feedback

0 references

Families of finite sets in which no set is covered by the union of \(r\) others

0 references

Families of finite sets in which no set is covered by the union of two others

0 references

Asymptotic solution of the Turán problem for some hypergraphs

0 references

On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs

0 references

An extension of the Ruzsa-Szemerédi theorem

0 references

Identifiers

zbMATH Open document ID

0 references

10.1017/S0963548311000563

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2883859

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2883859&oldid=37183196"