Generalized Turán numbers for the edge blow-up of a graph (Q6080138): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4386435362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs for intersecting cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs for intersecting triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Turán problems for complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs for blow-ups of cycles and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Independent Complete Subgraphs in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5548826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Turán number for the edge blow-up of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Turán number of the square of a path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs for edge blow-up of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized Turán number of two disjoint cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of triangles in \(F_k\)-free graphs / rank
 
Normal rank

Latest revision as of 09:35, 3 August 2024

scientific article; zbMATH DE number 7756946
Language Label Description Also known as
English
Generalized Turán numbers for the edge blow-up of a graph
scientific article; zbMATH DE number 7756946

    Statements

    Generalized Turán numbers for the edge blow-up of a graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 October 2023
    0 references
    blow-up graph
    0 references
    Turan number
    0 references
    extremal problems
    0 references

    Identifiers