A Note on Ramsey (K<sub>1, 2</sub>, C<sub>4</sub>) - Minimal Graphs of Diameter 2
Abstract eng: For graphs F , G and H, we write F → (G, H) to mean that if the edges of F are colored with two colors, say red and blue, then the red subgraph contains a copy of G or the blue subgraph contains a copy of H. The graph F is (G, H)-minimal (Ramsey-minimal) if F → (G, H) but F ∗ (G, H) for any proper subgraph F ∗ ⊂ F . We present new Ramsey (K1,2 , C4 )−minimal graphs of diameter 2.
Contributors:
Publisher:
Slovak University of Technology in Bratislava, Faculty of Civil Engineering, 2008
Conference Title:
Conference Title:
International Scientific Conference 70 Years of FCE STU
Conference Venue:
Bratislava (SK)
Conference Dates:
2008-12-04 / 2008-12-05
Rights:
Text je chráněný podle autorského zákona č. 121/2000 Sb.
Record appears in:
Record created 2014-11-05, last modified 2014-11-18
guest ::
