Mathematics – Combinatorics
Scientific paper
2004-11-30
Discrete Appl. Math. 150 (2005), no. 1-3, 41--50
Mathematics
Combinatorics
11 pages, 1 figure
Scientific paper
A digraph D=(V,A) is mediated if, for each pair x,y of distinct vertices of D, either xy belongs to A or yx belongs to A or there is a vertex z such that both xz,yz belong to A. For a digraph D, DELTA(D) is the maximum in-degree of a vertex in D. The "nth mediation number" mu(n) is the minimum of DELTA(D) over all mediated digraphs on n vertices. Mediated digraphs and mu(n) are of interest in the study of quantum nonlocality. We obtain a lower bound f(n) for mu(n) and determine infinite sequences of values of n for which mu(n)=f(n) and mu(n)>f(n), respectively. We derive upper bounds for mu(n) and prove that mu(n)=f(n)(1+o(1)). We conjecture that there is a constant c such that mu(n)=
Gutin Gregory
Jones Nick S.
Rafiey Arash
Severini Simone
Yeo Anders
No associations
LandOfFree
Mediated Digraphs and Quantum Nonlocality does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Mediated Digraphs and Quantum Nonlocality, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mediated Digraphs and Quantum Nonlocality will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-14173