Cargando…
Sharp threshold for random graphs with a monochromatic triangle in every edge coloring
Autores principales: | Friedgut, Ehud, Rödl, Vojtech, Ruciński, Andrzej, Tetali, Prasad |
---|---|
Lenguaje: | eng |
Publicado: |
American Mathematical Society
2005
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/2682355 |
Ejemplares similares
-
Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture
por: Stiebitz, Michael, et al.
Publicado: (2012) -
Color-induced graph colorings
por: Zhang, Ping
Publicado: (2015) -
Threshold graphs and related topics
por: Mahadev, N V R, et al.
Publicado: (1995) -
Properly colored connectivity of graphs
por: Li, Xueliang, et al.
Publicado: (2018) -
Locally finite, planar, edge-transitive graphs
por: Graver, Jack E, et al.
Publicado: (1997)