Combinatorics and Graph Theory

    

Test for Mathematical Abilities of LLMs

Authors: Dainis Zeps

Two graphs given, a sample of flower snark, published by Rufus Isaacs in 1975, and graph constructed by Emanuels Grinbergs in 1972. Prove that both graphs are isomorphic. The proof should be in one line, suggestedly no longer than five words.We suggest to take it as a test to compare different LLMs of their ability to solve simple mathematical problems.

Comments: 1 Page. https://lingua.id.lv/alex/flower.snarks.pdf

Download: PDF

Submission history

[v1] 2025-12-22 08:06:14

Unique-IP document downloads: 170 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus