Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Krop Irina"'
Autor:
Krop Elliot, Krop Irina
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 33, Iss 4, Pp 771-784 (2013)
Let f(n, p, q) be the minimum number of colors necessary to color the edges of Kn so that every Kp is at least q-colored. We improve current bounds on these nearly “anti-Ramsey” numbers, first studied by Erdös and Gyárfás. We show that , sligh
Externí odkaz:
https://doaj.org/article/9107c7fffeb04448b286d283819118fc
Autor:
Krop, Elliot, Krop, Irina
This appendix for our article, "Almost-rainbow edge-colorings of some small subgraphs", contains the full proof of Theorem 4.1.
Comment: 26 pages
Comment: 26 pages
Externí odkaz:
http://arxiv.org/abs/1112.4381
Autor:
Krop, Elliot, Krop, Irina
Publikováno v:
Discussiones Mathematicae Graph Theory 33(4), p. 771-784 (2013)
Let $f(n,p,q)$ be the minimum number of colors necessary to color the edges of $K_n$ so that every $K_p$ is at least $q$-colored. We improve current bounds on the {7/4}n-3$, slightly improving the bound of Axenovich. We make small improvements on bou
Externí odkaz:
http://arxiv.org/abs/0803.0572