ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and let K2K_2 denote the complete graph with two vertices. A graph is 1-planar if it has a drawing in the plane in which every edge is crossed by at most one other edge. A cactus is a connected graph in which every edge belongs to at most one cycle. Bucko–Czap's conjecture. The graph G∘K2G\circ K_2 is 1-planar if and only if GG is a cactus. This open problem characterizes 1-planarity for lexicographic products with K2K_2 and concerns the relationship between graph substitution and sparse crossing structures.

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.