Many H-Copies in Graphs with a Forbidden Tree (Q5204067): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1811.04287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many \(T\) copies in \(H\)-free graphs / 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: Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5724802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the maximum number of triangles in a \(C_5\)-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the Number of Independent Sets of a Fixed Size / 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 forbidden subposet problems / 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: Counting copies of a fixed subgraph in \(F\)-free 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: On the maximum number of five-cycles in a triangle-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of $P_\ell$ copies in $P_k$-free graphs / 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: 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: Q5689007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shifting method and generalized Turán number of matchings / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2992144822 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:31, 30 July 2024

scientific article; zbMATH DE number 7141557
Language Label Description Also known as
English
Many H-Copies in Graphs with a Forbidden Tree
scientific article; zbMATH DE number 7141557

    Statements

    Many H-Copies in Graphs with a Forbidden Tree (English)
    0 references
    0 references
    9 December 2019
    0 references
    Turán
    0 references
    trees
    0 references
    extremal graph theory
    0 references

    Identifiers