On Turán's \((3,4)\)-problem with forbidden subgraphs (Q2341979): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3089368 / 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: On 3-Hypergraphs with Forbidden 4-Vertex Configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs / 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: Q3348936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum size of 3-graphs without a 4-set spanning no or exactly three edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flag algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Turán density of the hypergraph \(\{abc,ade,bde,cde\}\) / rank
 
Normal rank

Revision as of 01:05, 10 July 2024

scientific article
Language Label Description Also known as
English
On Turán's \((3,4)\)-problem with forbidden subgraphs
scientific article

    Statements

    Identifiers