Craig Larson
Associate Professor


email: clarson@vcu.edu 

31. A. Bradford, J. K. Day, L. Hutchinson, B. Kaperick, C. E. Larson, M. Mills, D. Muncy, and N. Van Cleemput, Automated Conjecturing II: Chomp and Reasoned Game Play, Journal of Artificial Intelligence Research (JAIR), 68 (2020) 447461.
30. C. E. Larson, (Avoiding) Proof by Contradiction: the Squarerootof2 is Not Rational, arXiv preprint.
29. R. Jacobs, C.E. Larson, A GraphTheoretic Formula for the Number of Primes, arXiv preprint.
28. N. Bushaw, J. Chen, H. LaFayette, C. E. Larson, N. Van Cleemput, Conjectured Bounds for the Independence Number of a Graph, submitted.
27. N. Bushaw, B. Conka, V. Gupta, A. Kierans, H. Lafayette, C. E. Larson, S. Loeb, K. McCall, A. Mulyar, C. Sullivan, S. Taylor, E. Wainright, E. Wilson, G. Wu, Bootstrap Percolation via Automated Conjecturing, submitted.
26. P. Brooks, D. Edwards, C.E. Larson, and N. Van Cleemput, Automated Conjecturing IV: Scientific Discovery and Classification, submitted.
25. N. Bushaw, C.E. Larson, N. Van Cleemput, Automated Conjectures for Graph Hamiltonicity, submitted.
24. L. Hutchinson, V. Kamat, C. E. Larson, S. Mehta, D. Muncy, and N. Van Cleemput, Automated Conjecturing VI: Domination Number of Benzenoids, MATCH, 2018.
23. C. E. Larson and N. Van Cleemput, Automated Conjecturing I: Fajtlowicz's Dalmatian Heuristic Revisited (Extended Abstract), Proceedings of the 2017 International Joint Conference on Artificial Intelligence (IJCAI17), Melbourne.
22. C. E. Larson and N. Van Cleemput, Automated Conjecturing III: Propertyrelations Conjectures, Annals of Mathematics and Artificial Intelligence 81(3) (2017) 315327.
21. C. E. Larson and N. Van Cleemput, Automated Conjecturing I: Fajtlowicz's Dalmatian Heuristic Revisited, Artificial Intelligence 231 (2016) 1738.
20. C. E. Larson and N. Van Cleemput, Forcing Independence, Croatica Chemica Acta, Vol.86, No.4, Dec. 2013, 469475.
19. G. Brinkmann, C. E. Larson, J. Souffriaua, N. Van Cleemput, Construction of Planar 4connected Triangulations, Ars Mathematica Contemporanea, Vol 9, No 2 (2015).
18. C. E. Larson, L. Mitchell, B. Lins, Graphs of Unitary Matrices and Positive Definite Zero Forcing, Reports on Mathematical Physics (ROMP), 72 (3), December 2013, 311320.
17. R. Gera, C. E. Larson, C. Rasmussen, and R. Pepper, Independence in Function Graphs, Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC 94) 2015, 301312.
16. D. J. Klein and C. E. Larson, Eigenvalues of Saturated Hydrocarbons, Journal of Mathematical Chemistry 51(6) 2013, 16081618.
15. C. E. Larson and R. Pepper, Three Bounds for the Independence Number of a Graph, Bulletin of the Institute of Combinatorics and its Applications 70, 2014, 8696.
14. E. DeLaVina and C. E. Larson, A Parallel Algorithm for Computing the Critical Independence Number and Related Sets, Ars Mathematica Contemporanea 6(2) 2013, 237245.
13. L. Eroh, R. Gera, C. Kang, C. E. Larson, and E. Yi, Domination in Functigraphs, Discussiones Mathematicae Graph Theory 32 (2012).
12. C. E. Larson and R. Pepper, Graphs with Equal Independence and Annihilation Numbers, Electronic Journal of Combinatorics, 18(1) 2011.
11. E. DeLaVina, C. E. Larson, R. Pepper, and B. Waller, A Characterization of Graphs where the Independence Number Equals the Radius, Graphs and Combinatorics 28 (2012) 315332.
10. C. E. Larson, The Critical Independence Number and an Independence Decomposition, European Journal of Combinatorics 32(2), 2011, 294300.
9. G. AbayAsmeron, R. Hammack, C. E. Larson, D. T. Taylor, Notes on the independence number in the Cartesian product of graphs, Discussiotnes Mathematica Graph Theory 31(1), 2011, 2535.
8. E. DeLaVina, C. Larson, R. Pepper and B. Waller, On total domination and support vertices of a tree, AKCE International Journal of Graphs and Combinatorics, 7 (1), 2010, 8595.
7. E. DeLaVina, C. E. Larson, R. Pepper, and B. Waller, Graffiti.pc on the 2domination number of a graph, Congressus Numerantium 203, 2010, 1532.
6. G. AbayAsmerom, R. Hammack, C. E. Larson, and D. Taylor, Direct Product Factorization of Bipartite Graphs with BipartiteSwitching Involutions, SIAM Journal on Discrete Mathematics 20(4), 2010, 20422052.
5. E. DeLaVina, C. E. Larson, R. Pepper, and B. Waller, Graffiti.pc on the total domination number of a tree, Congressus Numerantium 195, 2009, 518.
4. C. E. Larson, A Note on Critical Independence Reductions, Bulletin of the Institute of Combinatorics and its Applications 5, 2007, 3446.
3. C. E. Larson, A Survey of Research in Automated Mathematical Conjecturemaking, in Graphs and Discovery, ed. by S. Fajtlowicz, P. W. Fowler, P. Hansen, M. F. Janowitz and F. S. Roberts, DIMACS, 2005, 297318.
2. S. Fajtlowicz and C. E. Larson, Graphtheoretic Independence as a Predictor of Fullerene Stability, ChemicalPhysics Letters, 377/56, 2003, 485490.
1. C. E. Larson, Intelligent Machinery and Mathematical Discovery, Graph Theory Notes of the New York Academy of Science XLII, 2002, 817.
Books
2. R. Gera, S. Hedetniemi, C. E. Larson, eds., Graph Theory: Favorite Conjectures and Open Problems, 2016.
1. C. E. Larson, Graph Theoretic Independence and Critical Independent Sets (dissertation), 2008.
Other
8. N. Bushaw, C. E. Larson, N. Van Cleemput, Automated Conjecturing VII: The Graph Brain Project & Big Mathematics (arXiv preprint).
7. K. Chilakamarri, M. F. Khan, C. E. Larson, and C. J. Tymczak, Selfsimilar Graphs ().
6. C. E. Larson, VCU's New AntiScience Curriculum, Richmond TimesDispatch, Mar. 18, 2018, (long version).
5. C. E. Larson, How to Respond to Obscure Writing, August 2016.
4. C. E. Larson, Inequality and an American Principle of Fairness, August 2016.
3. C. E. Larson, In Defense of Being Offensive: Our Responsibility as Intellectuals, July 2016.
2. C. E. Larson, School success requires more than good intentions, Richmond TimesDispatch, Sept. 13, 2015.
1. C. E. Larson, Technology, Education and the SingleSalary Schedule, Notices of the American Mathematical Society, May 2006, 525.
Online Talks
Automated Conjecturing for Proof Discovery, University of Western Ontario, 2016.
I attended Mater Dei High School I was a Congressional Page, ran cross country and track (I ran a 4:50 mile as a sophomore), and was pretty geeky. I went to the University of Houston on a National Merit scholarship. In college I studied philosophy as well as math, and have advanced degrees in both. I taught for many years in the math department at the University of Houston, where I won a teaching award, and met my beautiful wife Jeanine. I was also a member of Tau Kappa Epsilon fraternity's Epsilon Omicron chapter, and later the faculty advisor.
Jeanine and I are both big music fans and cat lovers. We like to run, bike, travel, read, eat, see bands, movies and the ballet. We have a little guy, Linus Carl Larson, with us in our adventures. And now I'm at VCU, where I've also won a teaching award.
My research currently involves graph theory, combinatorial optimization and artificial intelligence; but I'm interested in many many many things. In the spring of 2012, I was at Texas A&M University, Galveston, working with, and learning from Doug Klein, a theoretical chemist and chemical graph theorist, and in Spring 2013, I was at Ghent University, Belgium, as a Fulbright Research Scholar, working with Gunnar Brinkmann, an expert in graph algorithms and graph generation.
I am a member of Heterodox Academy which aims to "improve the quality of research and education in universities by increasing viewpoint diversity, mutual understanding, and constructive disagreement." (I follow John Stuart Mill and Justice Brandeis on the importance of engagement and discussion).
Be a punk, question authorities, think for yourself, put yourself out there, and give it your all. Stop watching TV. Be active. Do stuff. "Start your own band. Write your own book. Paint your own picture!"
NSA Statement: I do not accept grant money from the NSA, I do not do any work for the NSA, including refereeing grant proposals (and have notified them of this). The NSA is a dangerous and antidemocratic organization. Here is what Senator Church said about the NSA in 1975:
"In the need to develop a capacity to know what potential enemies are doing, the United States government has perfected a technological capability that enables us to monitor the messages that go through the air. (...) Now, that is necessary and important to the United States as we look abroad at enemies or potential enemies. We must know, at the same time, that capability at any time could be turned around on the American people, and no American would have any privacy left such is the capability to monitor everythingtelephone conversations, telegrams, it doesn't matter. There would be no place to hide.
If this government ever became a tyranny, if a dictator ever took charge in this country, the technological capacity that the intelligence community has given the government could enable it to impose total tyranny, and there would be no way to fight back because the most careful effort to combine together in resistance to the government, no matter how privately it was done, is within the reach of the government to know. Such is the capability of this technology. (...)
I don't want to see this country ever go across the bridge. I know the capacity that is there to make tyranny total in America, and we must see to it that this agency and all agencies that possess this technology operate within the law and under proper supervision so that we never cross over that abyss. That is the abyss from which there is no return."
For the background of Senator Church's remark, see: Church Committee (Wikipedia).
comments to: clarson@vcu.edu