Ramseyan Properties of Graphs
Copyright policy ) Ermelinda DeLaViña; Siemion Fajtlowicz;
Ramseyan Properties of Graphs
Every graph of chromatic number $k$ with more than $k(r-1)(b-1)$ vertices has a $b$-element independent set of vertices such that if any two of them are joined by an edge then the chromatic number stays the same or a $r$-element independent set of vertices such that joining any two of them by an edge increases the chromatic number.
- University of Houston United States
independent set, chromatic number, Generalized Ramsey theory, Ramsey graph
independent set, chromatic number, Generalized Ramsey theory, Ramsey graph
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
selected citations
Citations provided by BIP!
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
Citations provided by BIP!popularityPopularity provided by BIP!
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
Popularity provided by BIP! 2
Average
Average
Average
gold
Fields of Science