COMPLETING AN EDGE-COLOURING OF K2m WITH Kr AND INDEPENDENT EDGES PRECOLOURED
نویسندگان
چکیده
Those (2m−1)-edge-colourings of a spanning subgraph of K2m , consisting of Kr and independent edges, that can be embedded in a (2m− 1)-edge-colouring of K2m are characterised.
منابع مشابه
Cliques in random graphs
1. Introduction. Let 0 < p < 1 be fixed and denote by G a random graph with point set N, the set of natural numbers, such that each edge occurs with probability p, independently of all other edges. In other words the random variables ei5 , 1 < i < j, defined by _ 1 if (i, j) is an edge of G, et '-0 if (i, j) is not an edge of G, are independent r .v.'s with P(e i, = 1) = p, P(eij = 0) = 1-p. De...
متن کاملLarge Kr-free subgraphs in Ks-free graphs and some other Ramsey-type problems
In this paper we present three Ramsey-type results, which we derive from a simple and yet powerful lemma, proved using probabilistic arguments. Let 3 ≤ r < s be fixed integers and let G be a graph on n vertices not containing a complete graph Ks on s vertices. More than 40 years ago Erdős and Rogers posed the problem of estimating the maximum size of a subset of G without a copy of the complete...
متن کاملOn almost 1-extendable graphs
A graph G is 1-extendable or almost 1-extendable if every edge is contained in a perfect or almost perfect matching of G, respectively. Let d ≥ 3 be an integer, and let G be a graph of order n with exactly one odd component such that the degree of each vertex is either d or d + 1. If G is not almost 1-extendable, then we prove that n ≥ 2d + 5. In the special case that d ≥ 4 is even and G is a d...
متن کاملEvaluation of Ca-Independent a-Amylase Production by Bacillus sp. KR-8104 in Submerged and Solid State Fermentation Systems
This study investigates the production of crude Ca-independent and low pH active α-amylase by Bacillussp. KR-8104 in submerged fermentation (SmF) and solid-state fermentation (SSF) systems. Differentparameters were evaluated in each system using “one factor at a time” approach to improve the production ofenzyme. The results showed that in the SmF the maximum enzyme production ...
متن کاملColoring H-free hypergraphs
Fix r ≥ 2 and a collection of r-uniform hypergraphs H. What is the minimum number of edges in an H-free r-uniform hypergraph with chromatic number greater than k? We investigate this question for various H. Our results include the following: • An (r, l)-system is an r-uniform hypergraph with every two edges sharing at most l vertices. For k sufficiently large, there is an (r, l)-system with chr...
متن کامل