Danielle Gregg, Thomas W. Mattman, Zachary Porat, George Todd
Published 2020-08-29Version 1
Inspired by a question of Goldberg et al., we investigate the size of the $\nabla Y$ family for a complete multipartite graph. Aside from three families, which appear to grow exponentially, these families stabilize: after a certain point, increasing the number of vertices in the largest part does not change family size.
Comments: 18 pages, 14 figures
On the number of non-isomorphic (simple) $k$-gonal biembeddings of complete multipartite graphs
The 4-girth-thickness of the complete multipartite graph
Evacuating "O''- and "Y''-shaped houses on fire: the connectivity of friends-and-strangers graphs on complete multipartite graphs
![QR code for arXiv:2008.12975 [math.CO]](http://oss.arxitics.com/images/favicon.svg)