| Autor: |
Gary Chartrand, Ritabrato Chatterjee, Ping Zhang |
| Jazyk: |
angličtina |
| Rok vydání: |
2023 |
| Předmět: |
|
| Zdroj: |
Axioms, Vol 12, Iss 11, p 1019 (2023) |
| Druh dokumentu: |
article |
| ISSN: |
2075-1680 |
| DOI: |
10.3390/axioms12111019 |
| Popis: |
Every red–blue coloring of the edges of a graph G results in a sequence G1, G2, …, Gℓ of pairwise edge-disjoint monochromatic subgraphs Gi (1≤i≤ℓ) of size i, such that Gi is isomorphic to a subgraph of Gi+1 for 1≤i≤ℓ−1. Such a sequence is called a Ramsey chain in G, and ARc(G) is the maximum length of a Ramsey chain in G, with respect to a red–blue coloring c. The Ramsey index AR(G) of G is the minimum value of ARc(G) among all the red–blue colorings c of G. If G has size m, then k+12≤m
|
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
|
Nepřihlášeným uživatelům se plný text nezobrazuje |
K zobrazení výsledku je třeba se přihlásit.
|
