ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Problem 1. Find a good characterization for undirected graphs having an acyclic orientation so that the in-degree of every node is even. Problem 2. Find a good characterization for undirected graphs G=(V,E)\displaystyle G=(V,E) and T⊆V\displaystyle T\subseteq V, having an acyclic orientation so that the in-degree of a node is odd iff it is in T.\displaystyle T. Problem 3. Find a good characterization for undirected graphs G=(V,E)\displaystyle G=(V,E) which, for every possible T⊊V\displaystyle T\subsetneq V satisfying ∣T∣+∣E∣\displaystyle |T|+|E| even, have an acyclic orientation so that the in-degree of a node is odd iff it is in T.\displaystyle T.

Record

Added
Links

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.