scientific article; zbMATH DE number 3910184

From MaRDI portal
Publication:3686470





[For the entire collection see Zbl 0559.00001.] Given is a finite complete graph \(K_ n\). Two players, red and blue, alternately pick an unpicked edge with red going first. Then red can achieve \(n/2+c \log n\) red degree in some vertex, but cannot achieve \(n/2+c\sqrt{n \log n}\) red degree if blue played well. The previous statement holds in case of a bipartite graph \(K_{n,n}\) instead of \(K_ n\) as well. These theorems are interesting in comparison to the fact that during both games red cannot achieve a vertex of red degree 3 not incident to any blue edge, if blue played well. In Theorems 1 and 2 \(\Delta_ 1({\mathcal F}_ n)\) is equal to 2 instead of 1 as erroneously printed.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686470)