On generalized Turán number of two disjoint cliques (Q2154554): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Many \(T\) copies in \(H\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pentagons vs. triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the maximum number of triangles in a <i>C</i><sub>5</sub>‐free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On intersecting families of finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite set-systems whose every intersection is a kernel of a star / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Turán problems for even cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Turán problems for disjoint copies of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalized Turán Problem and its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of cliques in graphs without long cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some sharp results on the generalized Turán numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5790850 / rank
 
Normal rank

Latest revision as of 16:05, 29 July 2024

scientific article
Language Label Description Also known as
English
On generalized Turán number of two disjoint cliques
scientific article

    Statements

    Identifiers