ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph of order nn, and let EP(G)=(pij)EP(G)=(p_{ij}) be its edge-path matrix, where pijp_{ij} is the maximum number of pairwise edge-disjoint paths between distinct vertices viv_i and vjv_j, and pii=0p_{ii}=0. Conjecture 1. For every positive integer qq, if pij≤qp_{ij}\leq q for all i,ji,j, then ∣E(G)∣≤(q+1)(n−1)2|E(G)|\leq \frac{(q+1)(n-1)}{2}. Conjecture 2. The graph GG is Eulerian if and only if every entry of EP(G)EP(G) is even; that is, GG is Eulerian if and only if pij≡0(mod2)p_{ij}\equiv 0\pmod 2 for all i,ji,j.

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.