Geodesic
On Ramsey $(K_{1,2}, Kₙ)$-minimal graphs
Discussiones Mathematicae. Graph Theory, Tome 32 (2012) no. 2, pp. 331-339

Voir la notice de l'article provenant de la source Library of Science

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).
Keywords: Ramsey minimal graph, edge coloring, 1-factor, complete graph 
@article{DMGT_2012_32_2_a11,
     author = {Ha{\l}uszczak, Mariusz},
     title = {On {Ramsey} $(K_{1,2}, Kₙ)$-minimal graphs},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {331--339},
     publisher = {mathdoc},
     volume = {32},
     number = {2},
     year = {2012},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2012_32_2_a11/}
}
TY  - JOUR
AU  - Hałuszczak, Mariusz
TI  - On Ramsey $(K_{1,2}, Kₙ)$-minimal graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2012
SP  - 331
EP  - 339
VL  - 32
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2012_32_2_a11/
LA  - en
ID  - DMGT_2012_32_2_a11
ER  - 
%0 Journal Article
%A Hałuszczak, Mariusz
%T On Ramsey $(K_{1,2}, Kₙ)$-minimal graphs
%J Discussiones Mathematicae. Graph Theory
%D 2012
%P 331-339
%V 32
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2012_32_2_a11/
%G en
%F DMGT_2012_32_2_a11
Hałuszczak, Mariusz. On Ramsey $(K_{1,2}, Kₙ)$-minimal graphs. Discussiones Mathematicae. Graph Theory, Tome 32 (2012) no. 2, pp. 331-339. http://geodesic.mathdoc.fr/item/DMGT_2012_32_2_a11/