On the maximum number of cliques in a graph (Q995772): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: math/0602191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cliques in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complete subgraphs of \(r\)-chromatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of triangles in a \(K_4\)-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Turán-type theorem for cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity, graph minors, and subgraph multiplicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5724802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of complete subgraphs and circuits contained in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3976610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the number of cliques in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the number of triangles in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the number of complete subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3874233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4159089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clique-extremal (p,q)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of maximum independent sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3333070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of complete subgraphs and circuits in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4106232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3669452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Complete Subgraphs of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper minor-closed families are small / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of q-cliques in a graph with no p-clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal and maximum independent sets in graphs with at mostr cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique graphs of packed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of a theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit theorems for complete subgraphs of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey-Turán theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hadwiger's number---A problem of the Nordhaus-Gaddum type / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal function for contractions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for complete minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Maximal Independent Sets in a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal independent sets in graphs with at mostr cycles / rank
 
Normal rank

Latest revision as of 14:09, 26 June 2024

scientific article
Language Label Description Also known as
English
On the maximum number of cliques in a graph
scientific article

    Statements

    On the maximum number of cliques in a graph (English)
    0 references
    0 references
    10 September 2007
    0 references
    extremal graph theory
    0 references
    Turán's theorem
    0 references
    clique
    0 references
    complete subgraph
    0 references
    degeneracy
    0 references
    graph minor
    0 references
    planar graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers