science

Reconstruction conjecture

Reconstruction conjecture is a science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Reconstruction conjecture rather than just read about it. In short: In graph theory, informally, the reconstruction conjecture says that graphs are determined uniquely by their subgraphs. It is due to Kelly and Ulam.

Key takeaways

Reconstruction conjecture belongs to science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Reconstruction conjecture to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Reconstruction conjecture from memory before moving on to harder problems.

Reference excerpt

In graph theory, informally, the reconstruction conjecture says that graphs are determined uniquely by their subgraphs. It is due to Kelly and Ulam.

Formal statements

Given a graph G = ( V , E ) {\displaystyle G=(V,E)} , a vertex-deleted subgraph of G {\displaystyle G} is a subgraph formed by deleting exactly one vertex from G {\displaystyle G} . By definition, it is an induced subgraph of G {\displaystyle G} . For a graph G {\displaystyle G} , the deck of G, denoted D ( G ) {\displaystyle D(G)} , is the multiset of isomorphism classes of all vertex-deleted subgraphs of G {\displaystyle G} . Each graph in D ( G ) {\displaystyle D(G)} is called a card. Two graphs that have the same deck are said to be hypomorphic. With these definitions, the conjecture can be stated as:

Reconstruction Conjecture: Any two hypomorphic graphs on at least three vertices are isomorphic. (The requirement that the graphs have at least three vertices is necessary because both graphs on two vertices have the same decks.) Harary suggested a stronger version of the conjecture:

Set Reconstruction Conjecture: Any two graphs on at least four vertices with the same sets of vertex-deleted subgraphs are isomorphic. Given a graph G = ( V , E ) {\displaystyle G=(V,E)} , an edge-deleted subgraph of G {\displaystyle G} is a subgraph formed by deleting exactly one edge from G {\displaystyle G} . For a graph G {\displaystyle G} , the edge-deck of G, denoted E D ( G ) {\displaystyle ED(G)} , is the multiset of all isomorphism classes of edge-deleted subgraphs of G {\displaystyle G} . Each graph in E D ( G ) {\displaystyle ED(G)} is called an edge-card.

Edge Reconstruction Conjecture: (Harary, 1964) Any two graphs with at least four edges and having the same edge-decks are isomorphic.

Recognizable properties In context of the reconstruction conjecture, a graph property is called recognizable if one can determine the property from the deck of a graph. The following properties of graphs are recognizable:

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Reconstruction conjecture

Start with the simplest possible case. Write down what Reconstruction conjecture claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Reconstruction conjecture before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Reconstruction conjecture ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Reconstruction conjecture

In research: Reconstruction conjecture appears in science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Reconstruction conjecture in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Reconstruction conjecture is common in secondary-school and first-year university syllabi. It links to neighbouring topics Conjectures, Unsolved problems in graph theory, so understanding it makes those chapters shorter.
In everyday life: Look for Reconstruction conjecture outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Reconstruction conjecture in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Reconstruction conjecture means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Reconstruction conjecture out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Reconstruction conjecture in simple terms?

In graph theory, informally, the reconstruction conjecture says that graphs are determined uniquely by their subgraphs. It is due to Kelly and Ulam.

Why does Reconstruction conjecture matter?

Because it connects several science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Reconstruction conjecture?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Reconstruction conjecture.