Bipartizing matchings and Sabidussi's compatibility conjecture
نویسندگان
چکیده
منابع مشابه
Eulerian colorings and the bipartizing matchings conjecture of Fleischner
Fleischner [3] has proposed a novel approach to several deep graph-theoretic conjectures, such as the Cycle Double Cover Conjecture [9,10] or the 5-Flow Conjecture of Tutte [12]. A key ingredient in this approach is the Bipartizing Matchings Conjecture (Conjecture 1.2 below, abbreviated BM Conjecture). In this paper, we introduce the notion of an Eulerian coloring of a trigraph, providing a set...
متن کاملConnected matchings and Hadwiger's conjecture
Conjecture 0.3 has a fairly interesting reformulation with some ”Ramsey flavor”. A set of pairwise disjoint edges e1, e2, . . . , et of G is called a connected matching of size t ([8]) if for every 1 ≤ i < j ≤ t there exists at least one edge of G connecting an endpoint of ei to an endpoint of ej . Alfréd Rényi Institute, Hungarian Academy of Sciences, Budapest 1364, P. O. Box 127 and Dept. of ...
متن کاملMistaken Matchings : Imperfect Compatibility Information in Kidney
The preferred treatment for patients with kidney disease is live-donor kidney transplantation. The prospective donors offering a kidney to a sick patient may not be compatible with the patient however; this creates an opportunity for kidney exchange, where incompatible pairs “swap” donors. Kidney exchanges benefit from scale but conducting real compatibility tests between all members of a large...
متن کاملBipartizing fullerenes
A fullerene graph is a cubic bridgeless planar graph with twelve 5-faces such that all other faces are 6-faces. We show that any fullerene graph on n vertices can be bipartized by removing O( √ n) edges. This bound is asymptotically optimal.
متن کاملTutte's 3-flow Conjecture and Matchings in Bipartite Graphs
Tutte’s 3-flow conjecture is equivalent to the assertion that there exists an orientation of the edges of a 4-edge-connected, 5-regular graph G for which the out-flow at each vertex is +3 or −3. The existence of one such orientation of the edges implies the existence of an equipartition of the vertices of G that separates the two possible types of vertices. Such an equipatition is called mod 3-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00076-0