Uniform hypergraphs containing no grids (Q390731): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086208008 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1103.1691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tracing a single user / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tracing Many Users With Almost No Rate Penalty / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an extremal hypergraph problem of Brown, Erdős and Sós / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sidon sets in groups and induced subgraphs of Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4063504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Integers Which Contain No Three Terms in Arithmetical Progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graphs that do not Contain a Thomsen Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of triangulated spheres in 3-graphs, and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5672676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing graphs: The packing problem solved / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-mitre Steiner triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4256358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4745752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal superimposed codes and designs for Renyi's search model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5543308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremal problems of graphs and generalized graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4134005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of finite sets in which no set is covered by the union of two others / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of finite sets in which no set is covered by the union of \(r\) others / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5520566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compactness results in extremal graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superimposed codes in R/sup n/ / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 6-sparse Steiner triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further 6-sparse Steiner triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new extremal property of Steiner triple-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Union-free families of sets and equations over fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of some Turán-type problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite classes of anti‐mitre and 5‐sparse Steiner triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(r\)-cover-free families / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved upper bound of the rate of Euclidean superimposed codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3984515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Sets Containing No Arithmetic Progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for Detecting All Defective Members in a Population by Group Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3780312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primes in short intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On upper bounds for unrestricted binary-error-correcting codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3285920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved asymptotic bounds for error-correcting codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrandom binary superimposed codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On optimal superimposed codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new results on superimposed codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct product construction for 5-sparse triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction Techniques for Anti-Pasch Steiner Triple Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple construction of \(d\)-disjunct matrices with certain constant weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5181380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the upper bound of the size of the \(r\)-cover-free families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a linear equation in a set of integers I / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of the Ruzsa-Szemerédi theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Turán-type hypergraph problem of Brown, Erdős and T. Sós / rank
 
Normal rank
Property / cites work
 
Property / cites work: Behrend-type constructions for sets of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3976643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sets of integers containing k elements in arithmetic progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer sets containing no arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An existence theory for pairwise balanced designs. I: Composition theorems and morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: 5-sparse Steiner triple systems of order \(n\) exist for almost all admissible \(n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The resolution of the anti‐mitre Steiner triple system conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of 5-sparse Steiner triple systems of order \(n \equiv 3 \mod 6\), \(n \notin \{9,15 \}\) / rank
 
Normal rank

Latest revision as of 05:31, 7 July 2024

scientific article
Language Label Description Also known as
English
Uniform hypergraphs containing no grids
scientific article

    Statements

    Uniform hypergraphs containing no grids (English)
    0 references
    0 references
    0 references
    8 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Turán hypergraph problem
    0 references
    density problems
    0 references
    union free hypergraphs
    0 references
    superimposed codes
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references