Maximum cliques in a graph without disjoint given subgraph (Q6117354): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2023.113863 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W4390597931 / 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: Pentagons vs. triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán Numbers of Multiple Paths and Equibipartite Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of triangles in a graph of given maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal paths and circuits of graphs / 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: Triangles in C5‐free graphs and hypergraphs of girth six / 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: Generalized Turán results for intersecting cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán numbers for disjoint copies of graphs / 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: 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: 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: Q5781249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shifting method and generalized Turán number of matchings / 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: Generalized Turán number for linear forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5790850 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2023.113863 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:36, 30 December 2024

scientific article; zbMATH DE number 7806392
Language Label Description Also known as
English
Maximum cliques in a graph without disjoint given subgraph
scientific article; zbMATH DE number 7806392

    Statements

    Maximum cliques in a graph without disjoint given subgraph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 February 2024
    0 references
    generalized Turán number
    0 references
    disjoint union
    0 references
    extremal graph
    0 references

    Identifiers