On Ramsey -minimal graphs
Let and be simple graphs. We write to mean that any red–blue coloring of all edges of will contain either a red copy of or a blue copy of A graph (without isolated vertices) satisfying and for each is called a Ramsey -minimal graph. The set of all Ramsey -minimal graphs is denoted by In this paper,...
I tiakina i:
| Ngā kaituhi matua: | , , , |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
Taylor & Francis Group
2018-08-01
|
| Rangatū: | AKCE International Journal of Graphs and Combinatorics |
| Ngā marau: | |
| Urunga tuihono: | http://dx.doi.org/10.1016/j.akcej.2017.08.003 |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|