Skip to content

Erdős problem 426

Start work

We say HH is a unique subgraph of GG if there is exactly one way to find HH as a subgraph (not necessarily induced) of GG. Is there a graph on nn vertices with ≫2(n2)n!\gg \frac{2^{\binom{n}{2}}}{n!} many distinct unique subgraphs?

Erdős Problems records this as disproved (Lean).

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal2 retained
  4. Resolutiondisproved (Lean)
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Open the work surface
Where the source files it274 share a topic
Graph Theory275
None carries a Standing. Browse the topic.
Start workOpen sources