TY - JOUR
T1 - Splitting digraphs
AU - Alon, Noga
PY - 2006/11
Y1 - 2006/11
N2 - The problems related to the partitioning of undirected graphs using undirectional analogues with no loops and no multiple edges was studied. The problem regarding for which values d1≥ d2 ≥··· ≥ dk 1, particularly finiteness of F(2,1) was analyzed. It was observed that the vertex set can be partitioned into two parts if the maximum degree is 2d+1. Characterization of all the sequences of integers (Δ, d1, d2, ·· ·, dk) for the vertex set of any digraph showed that (m+n, ≥ q+r)digraph must contain either an (digraph, ≥q)-digraph, or an (n, ≥)-digraph to be (n, ≥ q)-digraph containing at least q outdegrees.
AB - The problems related to the partitioning of undirected graphs using undirectional analogues with no loops and no multiple edges was studied. The problem regarding for which values d1≥ d2 ≥··· ≥ dk 1, particularly finiteness of F(2,1) was analyzed. It was observed that the vertex set can be partitioned into two parts if the maximum degree is 2d+1. Characterization of all the sequences of integers (Δ, d1, d2, ·· ·, dk) for the vertex set of any digraph showed that (m+n, ≥ q+r)digraph must contain either an (digraph, ≥q)-digraph, or an (n, ≥)-digraph to be (n, ≥ q)-digraph containing at least q outdegrees.
UR - http://www.scopus.com/inward/record.url?scp=33750329525&partnerID=8YFLogxK
U2 - 10.1017/S0963548306008042
DO - 10.1017/S0963548306008042
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:33750329525
SN - 0963-5483
VL - 15
SP - 933
EP - 937
JO - Combinatorics Probability and Computing
JF - Combinatorics Probability and Computing
IS - 6
ER -