Combinatorics and Graph Theory

2512 Submissions

[2] viXra:2512.0099 [pdf] submitted on 2025-12-22 08:06:14

Test for Mathematical Abilities of LLMs

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

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.
Category: Combinatorics and Graph Theory

[1] viXra:2512.0096 [pdf] submitted on 2025-12-21 01:10:59

Some Triconnected Graphs and Their Families Without Hamiltonian Cycles

Authors: Emanuels Grinbergs
Comments: 11 Pages. [Translated by Dainis Zeps]

Translation of Emanuels Grinbergs manuscript into English from Latvian Daži trīssakarīgi grafi un to saimes bez Hamiltona cikliem. In this manuscript flower snark graphs are mentioned that Grinbergs introduced already in 1972.
Category: Combinatorics and Graph Theory