Cory Palmer

Professor

Department of Mathematical Sciences

University of Montana

Google Scholar • ResearchGate • MathSciNet • arXiv

I am a professor in the Department of Mathematical Sciences at the University of Montana. Previously I was a visiting assistant professor at University of Illinois at Urbana-Champaign. Before that I was a junior research fellow at Alfréd Rényi Institute of Mathematics in Budapest, Hungary.

My research is concentrated mostly in extremal graph theory and combinatorics. I am especially interested in generalizations and extensions of Turán's theorem.

Publications

Submitted

Dániel Gerbner and Cory Palmer. Survey of generalized Turán problems -- counting subgraphs.
József Balogh, Anastasia Halfpap, Bernard Lidický, and Cory Palmer. Positive co-degree densities and jumps.
József Balogh, Van Magnan, and Cory Palmer. Generalized Ramsey-Turán Numbers.

Published

42. Anastasia Halfpap, Nathan Lemons, and Cory Palmer. Positive co-degree density of hypergraphs. J. Graph Theory, 110(2): 209-222, 2025 .

41. József Balogh, John Finlay and Cory Palmer, Rainbow connectivity of randomly perturbed graphs. J. Graph Theory, 109(2): 101-106, 2025.

40. Dániel Gerbner, Andrzej Grzesik, Cory Palmer, and Magdalena Prorok. Directed graphs without rainbow stars. Electron. J. Combin., 31(4): Paper No. 4.70, 2024.

39. Van Magnan, Cory Palmer, and Ryan Wood. A generalization of diversity for intersecting families, European J. Combin., 122:04041, 2024.

38. Daniel Johnston, P. Mark Kayll, and Cory Palmer, Deranged matchings: proofs and conjectures. The American Mathematical Monthly, 131(2):95-111, 2024.

37. Cory Palmer and Balázs Patkós. On the number of maximal independent sets: From Moon-Moser to Hujter-Tuza. J. Graph Theory, 102(2):440-445, 2023.

36. Dániel Gerbner, Tamás Mészáros, Abhishek Methuku, and Cory Palmer. Generalized rainbow Turán numbers. Electron. J. Combin., 29(2):Paper No. 2.44, 20, 2022.

35. Cory Palmer and Dömötör Pálvölgyi. At most 3.55^n stable matchings. In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science—FOCS 2021, pages 217–227. IEEE Computer Soc., Los Alamitos, CA, [2022] ©2022.

34. Dániel Gerbner and Cory Palmer. Some exact results for generalized Turán problems. European J. Combin., 103:Paper No. 103519, 13, 2022.

33. Omid Khormali and Cory Palmer. Turán numbers for hypergraph star forests. European J. Combin., 102:Paper No. 103506, 17, 2022.

32. Martin Balko, Dániel Gerbner, Dong Yeap Kang, Younjin Kim, and Cory Palmer. Hypergraph based Berge hypergraphs. Graphs Combin., 38(1):Paper No. 11, 13, 2022.

31. Anastasia Halfpap and Cory Palmer. Rainbow cycles versus rainbow paths. Australas. J. Combin., 81:152–169, 2021.

30. József Balogh, Nathan Lemons, and Cory Palmer. Maximum size intersecting families of bounded minimum positive co-degree. SIAM J. Discrete Math., 35(3):1525–1535, 2021.

29. Anastasia Halfpap and Cory Palmer. On supersaturation and stability for generalized Turán problems. J. Graph Theory, 97(2):232–240, 2021.

28. Dániel Gerbner, Abhishek Methuku, and Cory Palmer. General lemmas for Berge-Turán hypergraph problems. European J. Combin., 86:103082, 15, 2020.

27. Sean English, Dániel Gerbner, Abhishek Methuku, and Cory Palmer. On the weight of Berge-F-free hypergraphs. Electron. J. Combin., 26(4):Paper No. 4.7, 2019.

26. Dániel Gerbner and Cory Palmer. Counting copies of a fixed subgraph in F-free graphs. European J. Combin., 82:103001, 15, 2019.

25. Cory Palmer, Michael Tait, Craig Timmons, and Adam Zsolt Wagner. Turán numbers for Berge-hypergraphs and related extremal problems. Discrete Math., 342(6):1553–1563, 2019.

24. Emese Pálfi, L Zalányi, M Ashaber, C Palmer, Orsolya Kántor, AW Roe, RM Friedman, L Négyessy. Connectivity of neuronal populations within and between areas of primate somatosensory cortex. Brain Structure and Function 223 (6), 2949-2971, 2018.

23. Dániel Gerbner, Balázs Keszegh, Cory Palmer, and Balázs Patkós. On the number of cycles in a graph with restricted cycle lengths. SIAM J. Discrete Math., 32(1):266–279, 2018.

22. Fabrício S. Benevides, Dániel Gerbner, Cory T. Palmer, and Dominik K. Vu. Identifying defective sets using queries of small size. Discrete Math., 341(1):143–150, 2018.

21. Dániel Gerbner and Cory Palmer. Extremal results for Berge hypergraphs. SIAM J. Discrete Math., 31(4):2314–2327, 2017.

20. Daniel Johnston, Cory Palmer, and Amites Sarkar. Rainbow Turán problems for paths and forests of stars. Electron. J. Combin., 24(1):Paper No. 1.34, 15, 2017.

19. Emese Pálfi, Mária Ashaber, Cory Palmer, Robert M Friedman, Anna W Roe, László Négyessy. Neuronal connections within the hand representation in areas 3b and 1 of the somatosensory cortex in primates. Orvosi Hetilap 157 (33), 1320-1325, 2016

18. József Balogh, Michelle Delcourt, Bernard Lidický, and Cory Palmer. Rainbow copies of C4 in edge-colored hypercubes. Discrete Appl. Math., 210:35–37, 2016.

17. Dániel Gerbner, Balázs Keszegh, Cory Palmer, and Dömötör Pálvölgyi. Topological orderings of weighted directed acyclic graphs. Inform. Process. Lett., 116(9):564–568, 2016.

16. József Balogh and Cory Palmer. On the tree packing conjecture. SIAM J. Discrete Math., 27(4):1995–2006, 2013.

15. Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, and Balázs Patkós. Saturating Sperner families. Graphs Combin., 29(5):1355–1364, 2013.

14. László Négyessy, Emese Pálfi, Mária Ashaber, Cory Palmer, Balázs Jákli, Robert M Friedman, Li M Chen, Anna W Roe. Intrinsic horizontal connections process global tactile, Journal of Comparative Neurology 521 (12), 2798-2817, 2013.

13. Bernard Lidický, Hong Liu, and Cory Palmer. On the Turán number of forests. Electron. J. Combin., 20(2):Paper 62, 13, 2013.

12. Asaf Ferber, Roman Glebov, Michael Krivelevich, Hong Liu, Cory Palmer, Tomáš Valla, and Máté Vizer. The biased odd cycle game. Electron. J. Combin., 20(2):Paper 9, 10, 2013.

11. Dániel Gerbner, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós, and Vajk Szécsi. Almost cross-intersecting and almost cross-Sperner pairs of families of sets. Graphs Combin., 29(3):489–498, 2013.

10. Dániel Gerbner, Nathan Lemons, Cory Palmer, Balázs Patkós, and Vajk Szécsi. Cross-Sperner families. Studia Sci. Math. Hungar., 49(1):44–51, 2012.

9. Dániel Gerbner, Nathan Lemons, Cory Palmer, Balázs Patkós, and Vajk Szécsi. Almost intersecting families of sets. SIAM J. Discrete Math., 26(4):1657–1669, 2012.

8. Dániel Gerbner, Balázs Keszegh, and Cory Palmer. Generalizations of the tree packing conjecture. Discuss. Math. Graph Theory, 32(3):569–582, 2012.

7. Marcin Anholcer and Cory Palmer. Irregular labelings of circulant graphs. Discrete Math., 312(23):3461–3466, 2012.

6. Péter L. Erdős, Dániel Gerbner, Nathan Lemons, Dhruv Mubayi, Cory Palmer, and Balázs Patkós. Two-part set systems. Electron. J. Combin., 19(1):Paper 52, 10, 2012.

5. Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, and Balázs Patkós. Polychromatic colorings of arbitrary rectangular partitions. Discrete Math., 310(1):21–30, 2010.

4. Ervin Győri and Cory Palmer. A new type of edge-derived vertex coloring. Discrete Math., 309(22):6344–6352, 2009.

3. Fabricio Benevides, Jonathan Hulgan, Nathan Lemons, Cory Palmer, Ago-Erik Riet, and Jeffrey Paul Wheeler. Additive properties of a pair of sequences. Acta Arith., 139(2):185–197, 2009.

2. Nathan Lemons and Cory Palmer. The unbalance of set systems. Graphs Combin., 24(4):361–365, 2008.

1. Ervin Győri, Mirko Horňák, Cory Palmer, and Mariusz Woźniak. General neighbour-distinguishing index of a graph. Discrete Math., 308(5-6):827–831, 2008.