[[File:Thagomizer-graph.svg|thumb|The thagomizer graph {{math|''K''<sub>1,1,''n''</sub>}} is [[Multipartite graph|tripartite]]]]
In a 2017 paper, the term [[thagomizer graph]] (and also the associated "thagomizer [[matroid]]") has beenwas introduced for the [[Multipartite graph|complete tripartite graph]] {{math|''K''<sub>1,1,''n''</sub>}}.<ref>{{cite journal|last1=Gedeon|first1=Katie|last2=Proudfoot|first2=Nicholas|last3=Young|first3=Benjamin|date=2017|title=Kazhdan-Lusztig polynomials of matroids: a survey of results and conjectures|url=https://www.emis.de/journals/SLC/wpapers/FPSAC2017/80%20Gedeon%20Proudfoot%20Young.pdf|journal=Séminaire Lotharingien de Combinatoire|volume=78B|page=80|arxiv=1611.07474}}</ref>
