Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On cliques in graphs

From MaRDI portal
Publication:5971413
Jump to:navigation, search

DOI10.1007/BF02771637zbMath0163.18203OpenAlexW2055017029WikidataQ59409899 ScholiaQ59409899MaRDI QIDQ5971413

Paul Erdős

Publication date: 1966

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02771637


zbMATH Keywords

topology


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)


Related Items (5)

Stable fixed points of combinatorial threshold-linear networks ⋮ On the maximal independence polynomial of the covering graph of the hypercube up to \(n=6\) ⋮ Badly-covered graphs ⋮ On the maximum number of cliques in a graph ⋮ On cliques in graphs



Cites Work

  • On cliques in graphs


This page was built for publication: On cliques in graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5971413&oldid=15256939"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 05:34.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki