Many \(T\) copies in \(H\)-free graphs (Q5890921): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the number of subgraphs of prescribed type of graphs with a given number of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp bounds for some multicolour Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Norm-graphs: Variations and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complete subgraphs of different orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pentagons vs. triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5724802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Number of Triangles in <i>C</i><sub>2<i>k</i>+1</sub>-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of pentagons in triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of K. Zarankiewicz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectrum of projective norm-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781249 / rank
 
Normal rank

Latest revision as of 18:27, 12 July 2024

scientific article; zbMATH DE number 6639434
Language Label Description Also known as
English
Many \(T\) copies in \(H\)-free graphs
scientific article; zbMATH DE number 6639434

    Statements