Equations of tournaments are not finitely based

DOI10.1016/S0012-365X(99)00155-7zbMath0948.05031OpenAlexW2134046813MaRDI QIDQ1969795

Ralph McKenzie, Miklós Maróti, Jaroslav Jezek, Petar Marković

Publication date: 27 July 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00155-7

zbMATH Keywords

equationtournamentdirected graphs

Mathematics Subject Classification ID

Equational logic, Mal'tsev conditions (08B05) Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

Three-Variable Equations of Posets ⋮ One-Element Extensions in the Variety Generated by Tournaments ⋮ Unnamed Item ⋮ AGGREGATION AND IDEMPOTENCE ⋮ Combinatorial problems raised from 2-semilattices ⋮ Some recollections on early work with Jan Pelant

This page was built for publication: Equations of tournaments are not finitely based