Maximizing the Chances of a Color Match

From MaRDI portal

Revision as of 19:29, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2876873

Jump to:navigation, search

DOI10.2307/30044142zbMATH Open1293.97065OpenAlexW4231475817MaRDI QIDQ2876873FDOQ2876873

Roberto Pelayo, Ramin Naimi

Publication date: 20 August 2014

Published in: Mathematics Magazine (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/30044142

zbMATH Keywords

graph coloring problem color match probability of obtaining adjacent vertices

Mathematics Subject Classification ID

Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15) Probability theory (educational aspects) (97K50) Graph theory (educational aspects) (97K30)

This page was built for publication: Maximizing the Chances of a Color Match

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2876873&oldid=15825274"