On the Turán number of triple systems (Q1865386): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Vojtěch Rödl / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Alberto Márquez / rank
Normal rank
 
Property / author
 
Property / author: Vojtěch Rödl / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Alberto Márquez / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jcta.2002.3284 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2104509227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-graphs without two triples whose symmetric difference is contained in a third / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the Turán number \(t_3(n,4)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum size of 3-uniform hypergraphs not containing a Fano plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5203056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new generalization of the Erdős-Ko-Rado theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact result for 3-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4052170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133991 / rank
 
Normal rank

Latest revision as of 13:19, 5 June 2024

scientific article
Language Label Description Also known as
English
On the Turán number of triple systems
scientific article

    Statements

    On the Turán number of triple systems (English)
    0 references
    0 references
    0 references
    26 March 2003
    0 references
    The Turán density of some family of \(r\)-uniform hypergraphs is determined. More concretely, the authors focus on 3-uniform hypergraphs with nondegenerate Turán numbers, i.e., those whose Turán number is not \(o(n^3)\).
    0 references
    Turán numbers
    0 references
    triple systems
    0 references
    hypergraphs
    0 references
    Turán density
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references