Cyclic congruences of slim semimodular lattices and non-finite axiomatizability of some finite structures

Gábor Czédli

We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among FINITE graphs. (This fact is a consequence of a gene…