The falsity of the reconstruction conjecture for tournaments

Cited in

(49)

Hypomorphisms, orbits, and reconstruction
A census of non-reconstructable digraphs. I: Six related families
Sur certains tournois reconstructibles application à leurs groupes d'automorphismes
On a new digraph reconstruction conjecture
La reconstruction au sens de Ulam de certaines multirelations binaires. (The reconstruction in Ulam's sense of some binary multirelations)
Reconstruction of infinite graphs
The reconstruction of multirelations, at least one component of which is a chain
Note sur le problème de Ulam
Counterexamples to the Edge Reconstruction Conjecture for infinite graphs
Some results and approaches for reconstruction conjectures
Width two posets are reconstructible
Note on Kocay's 3-hypergraphs and Stockmeyer's tournaments
Reconstruction of finite truncated semi-modular lattices
Reconstruction of posets with the same comparability graph
Reconstruction of distance hereditary 2-connected graphs
The \((\leq 5)\)-hypomorphy of digraphs up to complementation
What is reconstruction for ordered sets?
Towards the reconstruction of posets
La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)
A larger class of reconstructible tournaments
The idiosyncratic polynomial of digraphs
A note on the adversary degree associated reconstruction number of graphs
Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible
Indecomposability graph and indecomposability recognition
Definability in the substructure ordering of simple graphs
Complexity in Young's lattice
An algebraic formulation of the graph reconstruction conjecture
Generalisations of hypomorphisms and reconstruction of hypergraphs
Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)
Erratum to: “The falsity of the reconstruction conjecture for tournaments”
Reconstructible and Half-Reconstructible Tournaments: Application to Their Groups of Hemimorphisms
The pairs of \(\{-3\}\)-hypomorphic tournaments
Leaf-reconstructibility of phylogenetic networks
Graphs with arbitrarily large adversary degree associated reconstruction number
Recognizing indecomposability for tournaments
Reconstruction of 2-connected parity graphs
Degree associated edge reconstruction number of split graphs with biregular independent set is one
A property of most of the known non-reconstructible digraphs
Reconstruction of small graphs and digraphs
Adversary degree associated reconstruction number of graphs
Graph theory (algorithmic, algebraic, and metric problems)
Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic
Degree associated edge reconstruction parameters of strong double brooms
Seurat games on Stockmeyer graphs
Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs
Description of the digraphs \(\{-1\}\)-hypomorphic to a reducible digraph
When a decomposable tournament is \(\{-1,3\}\)-reconstructible?
Reconstructing under group actions.
The double reconstruction conjecture about finite colored hypergraphs

This page was built for publication: The falsity of the reconstruction conjecture for tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4126364)