Density of Gallai multigraphs
The electronic journal of combinatorics, Tome 22 (2015) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Diwan and Mubayi asked how many edges of each color could be included in a $3$-edge-colored multigraph containing no rainbow triangle. We answer this question under the modest assumption that the multigraphs in question contain at least one edge between every pair of vertices. We also conjecture that this assumption is, in fact, without loss of generality.
DOI : 10.37236/4615
Classification : 05C15, 05C35
Mots-clés : rainbow triangle, Gallai coloring, multigraph

Colton Magnant  1

1 Georgia Southern University
@article{10_37236_4615,
     author = {Colton Magnant},
     title = {Density of {Gallai} multigraphs},
     journal = {The electronic journal of combinatorics},
     year = {2015},
     volume = {22},
     number = {1},
     doi = {10.37236/4615},
     zbl = {1307.05074},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/4615/}
}
TY  - JOUR
AU  - Colton Magnant
TI  - Density of Gallai multigraphs
JO  - The electronic journal of combinatorics
PY  - 2015
VL  - 22
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/4615/
DO  - 10.37236/4615
ID  - 10_37236_4615
ER  - 
%0 Journal Article
%A Colton Magnant
%T Density of Gallai multigraphs
%J The electronic journal of combinatorics
%D 2015
%V 22
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/4615/
%R 10.37236/4615
%F 10_37236_4615
Colton Magnant. Density of Gallai multigraphs. The electronic journal of combinatorics, Tome 22 (2015) no. 1. doi: 10.37236/4615

Cité par Sources :