Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
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
Keyphrases
Blowing
100%
Clique number
100%
Chromatic number
100%
Dense Graphs
100%
H-free
100%
Complete Graph
66%
Copy number
66%
Minimal Degree
33%
Forbidden Graph
33%
Mathematics
Clique
100%
Chromatic Number
100%
Complete Graph
66%
Edge
33%