A sharp threshold for random graphs with a monochromatic triangle in every edge coloring / / Ehud Friedgut [and three others].
Saved in:
Superior document: | Memoirs of the American Mathematical Society, number 845 |
---|---|
VerfasserIn: | |
Place / Publishing House: | Providence, Rhode Island : : American Mathematical Society,, [2006] 2006 |
Year of Publication: | 2006 |
Language: | English |
Series: | Memoirs of the American Mathematical Society ;
no. 845. |
Online Access: | |
Physical Description: | 1 online resource (80 pages) :; illustrations. |
Notes: | "Volume 179, number 845 (fourth of 5 numbers)." |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Graph colorings / / Marek Kubale, editor.
Published: ([2004]) -
Graph edge coloring : Vizing's theorem and Goldberg's conjecture / / Michael Stiebitz ... [et al.].
Published: (2012.) -
Orthogonal decompositions and functional limit theorems for random graph statistics / / Svante Janson.
by: Janson, Svante,
Published: (1994.) -
Locally finite, planar, edge-transitive graphs / / Jack E. Graver, Mark E. Watkins.
by: Graver, Jack E.,
Published: ([1997]) -
Algorithmic graph theory and perfect graphs / / Martin Charles Golumbic.
by: Golumbic, Martin Charles,
Published: (1980.)