Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Search by expertise, name or affiliation
H-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups
Noga Alon
, Clara Shikhelman
Research output
:
Contribution to journal
›
Article
›
peer-review
3
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'H-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Clique
100%
Subgraph
84%
Chromatic number
74%
Graph in graph theory
47%
Complete Graph
46%
Blow-up
22%