The falsity of the reconstruction conjecture for tournaments

Cited in

(49)

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

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)