$K_{5,5}$ is fully reconstructible in $\mathbb{C}^3$

Daniel Irving Bernstein, Steven J. Gortler

Type: Preprint

Publication Date: 2021-01-01

Citations: 0

DOI: https://doi.org/10.48550/arxiv.2110.10224

View Publication

Locations

arXiv (Cornell University) - View - PDF
DataCite API - View

Similar Works

Action	Title	Year	Authors
+	$K_{5,5}$ is fully reconstructible in $\mathbb{C}^3$.	2021	Daniel Irving Bernstein Steven J. Gortler
+ PDF Chat	Set Reconstruction on the Hypercube	2018	Luke Peabody
+	Graph Reconstruction from Connected Triples	2023	Yaxin Qi
+	Globally rigid graphs are fully reconstructible	2021	Dániel Garamvölgyi Steven J. Gortler Tibor Jordán
+ PDF Chat	The Thrackle conjecture for 𝐾₅ and 𝐾_{3,3}	2004	Grant Cairns Margaret McIntyre Yuri Nikolayevsky
+ PDF Chat	3-regular graphs are 2-reconstructible	2020	Alexandr Kostochka Mina Nahvi Douglas B. West Dara Zirlin
+	Ulam's Conjecture and Graph Reconstructions	1970	P. V. O'Neil
+	Ulam's Conjecture and Graph Reconstructions	1970	Peter V. O'Neil
+	The Gasca–Maeztu conjecture for $$n=5$$ n = 5	2013	Hakop Hakopian Kurt Jetter Georg Zimmermann
+ PDF Chat	Completely Regular Codes in Johnson and Grassmann Graphs with Small Covering Radii	2022	I. Yu. Mogilnykh
+	An algebraic formulation of the graph reconstruction conjecture	2013	Igor Carboni Oliveira Bhalchandra D. Thatte
+	An algebraic formulation of the graph reconstruction conjecture	2013	Igor Carboni Oliveira Bhalchandra D. Thatte
+ PDF Chat	La (-1)-reconstruction des graphes symétriques à au moins 3 éléments	2020	Mohamed Sghiar
+ PDF Chat	Classification of $ \mathbf{(3 \!\mod 5)} $ arcs in $ \mathbf{ \operatorname{PG}(3,5)} $	2021	Sascha Kurz Ivan Landjev Assia Rousseva
+	K - 5 -factor in a Graph.	2015	Hong-Jian Lai Yehong Shao Mingquan Zhan
+	Degree lists and connectedness are $3$-reconstructible for graphs with at least seven vertices	2019	Alexandr Kostochka Mina Nahvi Douglas B. West Dara Zirlin
+	Degree lists and connectedness are $3$-reconstructible for graphs with at least seven vertices	2019	Alexandr Kostochka Mina Nahvi Douglas B. West Dara Zirlin
+	Completely regular codes in Johnson and Grassmann graphs with small covering radii	2020	I. Yu. Mogilnykh
+ PDF Chat	Globally rigid graphs are fully reconstructible	2022	Dániel Garamvölgyi Steven J. Gortler Tibor Jordán
+	Characterization of Randomly k-Dimensional Graphs	2011	Mohsen Jannesari Behnaz Omoomi

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (0)

Action	Title	Year	Authors