scientific article; zbMATH DE number 1444472

MaRDI QIDQ4953537zbMATH OpenFDO

Authors Daniel Olejár, E. Toman

Publication date 9 May 2000

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

zbMATH Keywords

number of cliquesorder of cliquesrandom graph

Mathematics Subject Classification ID

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

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

Cites work

• An upper bound on the number of cliques in a graph
• Cliques in random graphs
• scientific article; zbMATH DE number 3427406 (Why is no real title available?)
• scientific article; zbMATH DE number 3902655 (Why is no real title available?)
• scientific article; zbMATH DE number 3917336 (Why is no real title available?)
• scientific article; zbMATH DE number 3950585 (Why is no real title available?)
• scientific article; zbMATH DE number 3333197 (Why is no real title available?)
• On cliques in graphs
• The maximum number of cliques in dense graphs
• The number of maximal independent sets in connected graphs

Cited in

(18)

• Clique numbers of graphs
• Cliques in rank-1 random graphs: the role of inhomogeneity
• Clique coverings of the edges of a random graph
• Counting sets with small sumset, and the clique number of random Cayley graphs
• A Tight Upper Bound on the Number of Variables for Average-Case k-Clique on Ordered Graphs
• Clique percolation
• Small cliques in random graphs
• scientific article; zbMATH DE number 4156479 (Why is no real title available?)
• Cliques in random graphs
• On the clique number of a random overlap graph
• scientific article; zbMATH DE number 1735728 (Why is no real title available?)
• Approximately counting cliques
• Maximal full subspaces in random projective spaces—thresholds and Poisson approximation
• Pairwise disjoint maximal cliques in random graphs and sequential motion planning on random right angled Artin groups
• Independent sets in graphs
• On cliques in graphs
• On the clique number of noisy random geometric graphs
• On the maximum number of cliques in a graph

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)