2 papers
math.CO2026
Interval Graphs are Reconstructible
Irene Heinrich, Masashi Kiyomi, Yota Otachi +1
A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture postulates that every graph of order…
math.CO2024
Finite Vertex-colored Ultrahomogeneous Oriented Graphs
Irene Heinrich, Eda Kaja, Pascal Schweitzer
A relational structure R is ultrahomogeneous if every isomorphism of finite induced substructures of R extends to an automorphism of R. We classify the ultrahomogeneous finite bina…