- Tytuł:
- On Ramsey $(K_{1,2}, Kₙ)$-minimal graphs
- Autorzy:
- Hałuszczak, Mariusz
- Powiązania:
- https://bibliotekanauki.pl/articles/743336.pdf
- Data publikacji:
- 2012
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
Ramsey minimal graph
edge coloring
1-factor
complete graph - Opis:
-
Let F be a graph and let , denote nonempty families of graphs. We write F → (,) if in any 2-coloring of edges of F with red and blue, there is a red subgraph isomorphic to some graph from G or a blue subgraph isomorphic to some graph from H. The graph F without isolated vertices is said to be a (,)-minimal graph if F → (,) and F - e not → (,) for every e ∈ E(F).
We present a technique which allows to generate infinite family of (,)-minimal graphs if we know some special graphs. In particular, we show how to receive infinite family of $(K_{1,2}, Kₙ)$-minimal graphs, for every n ≥ 3. - Źródło:
-
Discussiones Mathematicae Graph Theory; 2012, 32, 2; 331-339
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł