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
Tight Ramsey Bounds for Multiple Copies of a Graph
Matija Bucić
, Benny Sudakov
Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
5
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Tight Ramsey Bounds for Multiple Copies of a Graph'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Tight
100%
Ramsey
100%
Multi-copy
100%
Burr
100%
Copy number
75%
Long-time Behavior
50%
Ramsey number
50%
Disjoint Union
25%
Vertex-disjoint
25%
Very Old
25%
Ramsey Theory
25%
2-coloring
25%
Mathematics
Edge
100%
Clique
100%
Integer
100%