‎The excessive index of a bridgeless cubic graph $G$ is the least integer $k$‎, ‎such that $G$ can be covered by $k$ perfect matchings‎. ‎An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless‎ ‎cubic graph has excessive index at most five‎. ‎Clearly‎, ‎Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5‎, ‎so Fouquet and Vanherpe as...

Let D be a digraph. A subset S of V(D) is stable if every pair vertices in non-adjacent D. collection disjoint paths $$\mathcal {P}$$ path partition V(D), vertex on . We say that set and are orthogonal contains exactly one S. digraph satisfies the $$\alpha $$ -property for maximum D, there to -diperfect induced subdigraph -property. In 1982, Berge proposed characterization digraphs terms forbid...

‎There are a few finite groups that are determined up to isomorphism solely by their order, such as $mathbb{Z}_{2}$ or $mathbb{Z}_{15}$. Still other finite groups are determined by their order together with other data, such as the number of elements of each order, the structure of the prime graph, the number of order components, the number of Sylow $p$-subgroups for each prime $p$, etc. In this...

If G is a bridgeless cubic graph, Fulkerson conjectured that we can find 6 perfect matchings (a Fulkerson covering) with the property that every edge of G is contained in exactly two of them. A consequence of the Fulkerson conjecture would be that every bridgeless cubic graph has 3 perfect matchings with empty intersection (this problem is known as the Fan Raspaud Conjecture). A FR-triple is a ...

The main point of the construction of spin Calogero type classical integrable systems based on dynamical r-matrices, developed by L.-C. Li and P. Xu, is reviewed. It is shown that non-Abelian dynamical r-matrices with variables in a reductive Lie algebra F and their Abelian counterparts with variables in a Cartan subalgebra of F lead essentially to the same models.