新论文 · v1arXiv:2610.39760
EPPA for Reducts of the Random Graph
Sofia Brenner, Jan Hubička, Matěj Konečný
We prove that finite two-graphs have coherent EPPA and that neither graphs modulo global complementation nor two-graphs modulo global complementation have EPPA. This completes the classification of EPPA and coherent EPPA for the reducts of the random graph, answering a question and confirming a conjecture of Evans, Hubička, Konečný and Nešetřil.
尚无 AI 解读，展示原文摘要
math.CO · cs.DM · math.LO