Skip to main navigation
Skip to search
Skip to main content
Ariel University Home
Help & FAQ
Link opens in a new tab
English
עברית
العربية
Search content at Ariel University
Home
Profiles
Research units
Equipment
Research output
Prizes
Activities
Press/Media
Large rainbow cliques in randomly perturbed dense graphs
Elad Aigner-Horev
,
Dan Hefetz
, Shoham Letzter
, Oran Danon
Department of Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Large rainbow cliques in randomly perturbed dense graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Dense Graphs
100%
Rainbow Clique
100%
Anti-Ramsey Property
50%
Two-graph
50%
Proper Coloring
50%
Edge Density
50%
Random Edge
50%
Bipartite Graph
50%
Supersaturation
50%
Rainbow
50%
Even Cycles
50%
Mathematics
Edge
100%
Clique
100%
Bipartite Graph
33%