Maximum Δ\Delta-edge-colorable subgraphs of class II graphs

A graph $G$ is class II, if its chromatic index is at least $\Delta+1$. Let $H$ be a maximum $\Delta$-edge-colorable subgraph of $G$. The paper proves best possible lower bounds for $\frac{|E(H)|}{|E(G)|}$, and structural properties of maximum $\Delta$-edge-colorable subgraphs. It is shown that every set of vertex-disjoint cycles of a class II graph with $\Delta\geq3$ can be extended to a maximum $\Delta$-edge-colorable subgraph. Simple graphs have a maximum $\Delta$-edge-colorable subgraph such that the complement is a matching. Furthermore, a maximum $\Delta$-edge-colorable subgraph of a simple graph is always class I.Comment: 13 pages, 2 figures, the proof of the Lemma 1 is correcte

A geometric approach to divergent points of higher dimensional Collatz mappings

We define generalized Collatz mappings on free abelian groups of finite rank and study their iteration trajectories. Using geometric arguments we describe cones of points having a divergent trajectory and we deduce lower bounds for the density of the set of divergent points. As an application we give examples which show that the iteration of generalized Collatz mappings on rings of algebraic integers can behave quite differently from the conjectured behavior in $Z$.Comment: 11 pages, 1 figure, comments welcom

Reading Benjamin

Reading Benjamin