scientific article; zbMATH DE number 3258857
We quote the authors. In a graph-theoretic colloquium at Smolenice, \textit{G. A. Dirac} conjectured (see ibid. p. 167 problem 5) that the chromatic number of a proper regular subgraph of a complete \(n\)-gon is \(\leq 3n/5\). We shall prove this conjecture. In fact we shall prove the following theorem (\(G^{(n)}\) always denotes a graph with \(n\) vertices). Theorem. Let \(G^{(n)}\) be a regular graph of valence \(r<n-1\) and chromatic number \(k\). Then \(k \leq 3n/5\), with equality if and only if the components of the complementary graph \(\overline{G^{(n)}}\) of \(G^{(n)}\) are pentagons.
- Solution to the Dirac equation
- The Dirac equation and its solutions
- On some solutions of the Dirac equation
- Solution of the relativistic Dirac–Hulthén problem
- SOLUTION OF THE DIRAC EQUATION FOR POTENTIAL INTERACTION
- Solution of the integral Dirac equation in momentum space
- A new method for obtaining solutions of the Dirac equation
- A new class of solutions of the Dirac equation
- Solvability of Dirac type equations
- scientific article; zbMATH DE number 50759
- Inequalities between the domination number and the chromatic number of a graph
- Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs
- Solution of the integral Dirac equation in momentum space
- The Dirac equation and its solutions
- Some upper bounds for the product of the domination number and the chromatic number of a graph
- Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5544082)