ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let CC be a finite or countable graph with no isolated vertices. Decompose CC into its blocks, where each block is a 2-connected component, and let C~\tilde C be the underlying forest whose vertices are the blocks of CC, with adjacency determined by sharing a vertex. A graph is CC-free if it contains no copy of CC, and a universal graph may be universal either in the weak or strong sense. Solidity Conjecture. If there is a CC-free universal graph, in either the weak or strong sense, then every block of CC is complete. This conjecture asserts that the existence of a universal graph avoiding one finite connected constraint forces the constraint's block structure to be solid. The supplied text gives no resolution, so the conjecture remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.