← 研踪 PaperTrailarXiv:2610.39760 · v1
EPPA for Reducts of the Random Graph
首次提交 2026-10-29 18:13
版本更新 2026-10-29 18:13
雷达观测 2026-10-30 13:28
摘要
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.
观测到的版本
相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。
v1 · 2026-10-29 18:13 · 最新观测版本
EPPA for Reducts of the Random Graph
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.
查看此版本解读 →查看此版本原文 ↗