The minimum size of 3-graphs without a 4-set spanning no or exactly three edges (Q648971): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
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.1016/j.ejc.2011.03.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2099921939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs Do Jump / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3734434 / 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: Q4326635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A measure-theoretic approach to the theory of dense hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supersaturated graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadruple systems with independent neighborhoods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triple Systems Not Containing a Fano Configuration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability theorems for cancellative hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a hypergraph Turán problem of Frankl / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Turán number of the Fano plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of constructions for Turan's (3,4)-problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of dense graph sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new generalization of Mantel's theorem to \(k\)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact Turán result for the generalized triangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flag algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-Hypergraphs with Forbidden 4-Vertex Configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of the removal lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: What we know and what we do not know about Turán numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5548826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781249 / rank
 
Normal rank

Revision as of 16:31, 4 July 2024

scientific article
Language Label Description Also known as
English
The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
scientific article

    Statements

    The minimum size of 3-graphs without a 4-set spanning no or exactly three edges (English)
    0 references
    0 references
    29 November 2011
    0 references
    extremal hypergraphs
    0 references
    stability result
    0 references
    extremal function
    0 references

    Identifiers