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.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-10-29
DOI
https://doi.org/10.48550/arxiv.2610.39760
Primary Topic
Advanced Topology and Set Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

EPPA for Reducts of the Random Graph

Jan Hubička, Sofia Brenner, Matěj Konečný
arXiv (Cornell University)
Advanced Topology and Set Theory
preprint

EPPA for Reducts of the Random Graph

Jan Hubička, Sofia Brenner, Matěj Konečný
preprint en

Abstract

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.

arXiv (Cornell University)
Advanced Topology and Set Theory
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
EPPA for Reducts of the Random Graph — Jan Hubička, Sofia Brenner, et al. · arXiv (Cornell University) (2026) | TGRS Research Map | TGRS