Mark H. Siggers, Ph.D.
Affiliations: | 2005 | Emory University, Atlanta, GA |
Area:
MathematicsGoogle:
"Mark Siggers"Parents
Sign in to add mentor| Vojtech Rodl | grad student | 2005 | Emory | |
| (Integer and fractional packings in hypergraphs and Galois cohomology through cup products.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Lee J, Noel JA, Siggers MH. (2020) Reconfiguring graph homomorphisms on the sphere European Journal of Combinatorics. 86: 103086 |
| Brewster RC, Lee J, Moore B, et al. (2020) Graph homomorphism reconfiguration and frozen H‐colorings Journal of Graph Theory. 94: 398-420 |
| Siggers MH. (2018) Reflexive Graphs with Near Unanimity but no Semilattice Polymorphisms Electronic Journal of Combinatorics. 25 |
| Larose B, Siggers MH. (2018) NU Polymorphisms on Reflexive Digraphs Siam Journal On Discrete Mathematics. 32: 728-749 |
| Brewster RC, Siggers MH. (2018) A complexity dichotomy for signed H-colouring Discrete Mathematics. 341: 2768-2773 |
| Brewster RC, Lee J, Siggers MH. (2018) Recolouring reflexive digraphs Discrete Mathematics. 341: 1708-1721 |
| Lee SJ, Siggers M, Tokushige N. (2017) Towards extending the Ahlswede-Khachatrian theorem to cross t -intersecting families Discrete Applied Mathematics. 216: 627-645 |
| Nadjafi-Arani MJ, Siggers M, Soltani H. (2016) Characterisation of forests with trivial game domination numbers Journal of Combinatorial Optimization. 32: 800-811 |
| Akbari S, Jensen TR, Siggers M. (2015) Decompositions of graphs into trees, forests, and regular subgraphs Discrete Mathematics. 338: 1322-1327 |
| Frankl P, Lee SJ, Siggers M, et al. (2014) An Erdős-Ko-Rado theorem for cross t-intersecting families Journal of Combinatorial Theory, Series A. 128: 207-249 |