Read's conjecture
Read's conjecture is a conjecture, first made by Ronald Read, about the unimodality of the coefficients of chromatic polynomials in the context of graph theory.[1][2] In 1974, S. G. Hoggar sharpened this conjecture to the coefficients being log-concave. Hoggar's conjecture is called the Read-Hoggar conjecture.[3]Cite error: A <ref> tag is missing the closing </ref> (see the help page).[4][5]
References
- ^ Baker, Matthew (2018-01). "Hodge theory in combinatorics". Bulletin of the American Mathematical Society. 55 (1): 57–80. doi:10.1090/bull/1599. ISSN 0273-0979.
{{cite journal}}: Check date values in:|date=(help) - ^ R. C. Read, An introduction to chromatic polynomials, J. Combinatorial Theory 4 (1968), 52–71. MR0224505 (37:104)
- ^ Hoggar, S. G (1974-06-01). "Chromatic polynomials and logarithmic concavity". Journal of Combinatorial Theory, Series B. 16 (3): 248–254. doi:10.1016/0095-8956(74)90071-9. ISSN 0095-8956.
- ^ Kalai, Gil (July 2022). "The Work of June Huh" (PDF). Proceedings of the International Congress of Mathematicians 2022: 1–16., pp. 2–4.
- ^ Huh, June (2012-02-09). "Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs". arXiv:1008.4749 [math].
 | This mathematics-related article is a stub. You can help Wikipedia by expanding it. |