scientific article; zbMATH DE number 1444472

zbMATH Open0937.05067MaRDI QIDQ4953537FDOQ4953537

Authors: Daniel Olejár, E. Toman 

Publication date: 9 May 2000

Full work available at URL: https://eudml.org/doc/31676

Title of this publication is not available (Why is that?)

Recommendations

• Cliques in random graphs
• Small cliques in random graphs
• Clique coverings of the edges of a random graph
• Approximately counting cliques
• On cliques in graphs

zbMATH Keywords

random graphnumber of cliquesorder of cliques

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• On cliques in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Cliques in random graphs
• Title not available (Why is that?)
• The maximum number of cliques in dense graphs
• The number of maximal independent sets in connected graphs
• Title not available (Why is that?)
• An upper bound on the number of cliques in a graph
• Title not available (Why is that?)

Cited In (14)

• Counting sets with small sumset, and the clique number of random Cayley graphs
• Cliques in random graphs
• Pairwise disjoint maximal cliques in random graphs and sequential motion planning on random right angled Artin groups
• Title not available (Why is that?)
• Clique percolation
• A Tight Upper Bound on the Number of Variables for Average-Case k-Clique on Ordered Graphs
• Clique numbers of graphs
• Independent sets in graphs
• On the clique number of a random overlap graph
• Title not available (Why is that?)
• On the maximum number of cliques in a graph
• Cliques in rank-1 random graphs: the role of inhomogeneity
• On cliques in graphs
• On the clique number of noisy random geometric graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4953537)