Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs (Q4903261): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60692306, #quickstatements; #temporary_batch_1712201099914
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An analytic approach to stability / 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: Constructions of non-principal families in extremal hypergraph theory / 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: Method for construction of (3,4)-graphs / 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: On the structure of linear graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Turán density of triple systems is not principal / 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: Flag algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs Do Jump / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSDP, A C library for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Daisies and Other Turán Problems / 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: A class of constructions for Turan's (3,4)-problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Turán Number of<i>F</i><sub>3,3</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of five-cycles in a triangle-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Triple Systems with Independent Neighbourhoods / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact result for 3-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of the removal lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Turán number of triple systems / rank
 
Normal rank

Revision as of 03:23, 6 July 2024

scientific article; zbMATH DE number 6127309
Language Label Description Also known as
English
Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
scientific article; zbMATH DE number 6127309

    Statements

    Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs (English)
    0 references
    0 references
    0 references
    21 January 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Razborov's semi-definite method
    0 references
    Flagmatic
    0 references
    0 references