John Gimbel
1987 | Professor of Mathematics
Western Michigan University 1984, PhD
CH 304C | 907-474-6102
jggimbel@alaska.edu
I work in several branches of graph theory. Mostly I'm interested in Ramsey Theory and colorings. Ramsey Theory is based on the idea that complete disorder is impossible. Regardless of how scrambled a graph is, there is always some order that can be found somewhere. In coloring, graphs are partitioned so that each part has some sort of uniformity. Obviously, the two topics overlap--that's what interests me most.
Highlighted works:
A Note on the Maximal Order of an H-free Subgraph in a Random Graph (With P. Erdos) Proceedings of the Sixth International Conference on the Theory and Applications of Graphs (1991) 435-437.
Coloring Graphs with Bounded Genus and Girth (With C. Thomassen) . Trans. Am. Math. Soc. 349 (1997) 45 55-4564.
Coloring triangle-free graphs with fixed size (With C. Thomassen) . Discrete Math. 219 (2000), 275-277.
Some Remarks on the Convexity Number of a Graph. Graphs and Combinatorics 19 (2002) 357-361.
Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces. (With A. Kündgen, B. Li, C. Thomassen) SIAM J. Discrete Math. 33 (2019) no. 3, 1415-1430.
Defective Ramsey Numbers in Graph Classes. (With T. Ekim, Y. Demirci, M. Yildiz). Discrete Optim. Accepted.