Results 1  10
of
4,705
A NOTE ON CIRCULAR CHROMATIC NUMBER OF GRAPHS WITH LARGE GIRTH AND SIMILAR PROBLEMS
"... Abstract. In this short note, we extend the result of Galluccio, Goddyn, and Hell, which states that graphs of large girth excluding a minor are nearly bipartite. We also prove a similar result for the oriented chromatic number, from which follows in particular that graphs of large girth excluding ..."
Abstract
 Add to MetaCart
Abstract. In this short note, we extend the result of Galluccio, Goddyn, and Hell, which states that graphs of large girth excluding a minor are nearly bipartite. We also prove a similar result for the oriented chromatic number, from which follows in particular that graphs of large girth excluding
Circular Chromatic Number of Planar Graphs of Large Odd Girth
, 2001
"... It was conjectured by Jaeger that 4kedge connected graphs admit a (2k + 1; k)ow. The restriction of this conjecture to planar graphs is equivalent to the statement that planar graphs of girth at least 4k have circular chromatic number at most 2 + 1 k . Even this restricted version of Jaeger& ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
It was conjectured by Jaeger that 4kedge connected graphs admit a (2k + 1; k)ow. The restriction of this conjecture to planar graphs is equivalent to the statement that planar graphs of girth at least 4k have circular chromatic number at most 2 + 1 k . Even this restricted version of Jaeger
Increasing chromatic number and girth
, 2012
"... This expository paper deals with some interesting concepts related to the problem of increasing the chromatic number and the girth of a graph. Specifically, the proof of Kneserâs conjecture and also related concepts such as Galeâs distribution of points on the sphere and the Borsuk graph will b ..."
Abstract
 Add to MetaCart
This expository paper deals with some interesting concepts related to the problem of increasing the chromatic number and the girth of a graph. Specifically, the proof of Kneserâs conjecture and also related concepts such as Galeâs distribution of points on the sphere and the Borsuk graph
GIRTH AND CHROMATIC NUMBER OF GRAPHS
"... Abstract. This paper will look at the relationship between high girth and high chromatic number in both its finite and transfinite incarnations. On the one hand, we will demonstrate that it is possible to construct graphs with high oddgirth and high chromatic number in all cases. We will then look a ..."
Abstract
 Add to MetaCart
Abstract. This paper will look at the relationship between high girth and high chromatic number in both its finite and transfinite incarnations. On the one hand, we will demonstrate that it is possible to construct graphs with high oddgirth and high chromatic number in all cases. We will then look
Good ErrorCorrecting Codes based on Very Sparse Matrices
, 1999
"... We study two families of errorcorrecting codes defined in terms of very sparse matrices. "MN" (MacKayNeal) codes are recently invented, and "Gallager codes" were first investigated in 1962, but appear to have been largely forgotten, in spite of their excellent properties. The ..."
Abstract

Cited by 741 (23 self)
 Add to MetaCart
We study two families of errorcorrecting codes defined in terms of very sparse matrices. "MN" (MacKayNeal) codes are recently invented, and "Gallager codes" were first investigated in 1962, but appear to have been largely forgotten, in spite of their excellent properties
The role of deliberate practice in the acquisition of expert performance
 Psychological Review
, 1993
"... The theoretical framework presented in this article explains expert performance as the end result of individuals ' prolonged efforts to improve performance while negotiating motivational and external constraints. In most domains of expertise, individuals begin in their childhood a regimen of ef ..."
Abstract

Cited by 633 (13 self)
 Add to MetaCart
The theoretical framework presented in this article explains expert performance as the end result of individuals ' prolonged efforts to improve performance while negotiating motivational and external constraints. In most domains of expertise, individuals begin in their childhood a regimen
PROBLEMS AND RESULTS ON 3CHROMATIC HYPERGRAPHS AND SOME RELATED QUESTIONS
 COLLOQUIA MATHEMATICA SOCIETATIS JANOS BOLYAI 10. INFINITE AND FINITE SETS, KESZTHELY (HUNGARY)
, 1973
"... A hypergraph is a collection of sets. This paper deals with finite hypergraphs only. The sets in the hypergraph are called edges, the elements of these edges are points. The degree of a point is the number of edges containing it. The hypergraph is runiform if every edge has r points. A hypergraph i ..."
Abstract

Cited by 317 (0 self)
 Add to MetaCart
with chromatic number 2 were first investigated systematically by M i 11 e r (who used the term property B) in the case of infinite edges. There now is a large literature of this subject both for finite and infinite sets. The main idea behind our investigations is that being simple or being a clique imposes
Circular chromatic number and graph minor
, 2000
"... This paper proves that for any integer n ≥ 4 and any rational number r, 2 ≤ r ≤ n − 2, there exists a graph G which has circular chromatic number r and which does not contain Kn as a minor. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper proves that for any integer n ≥ 4 and any rational number r, 2 ≤ r ≤ n − 2, there exists a graph G which has circular chromatic number r and which does not contain Kn as a minor.
Codes and Decoding on General Graphs
, 1996
"... Iterative decoding techniques have become a viable alternative for constructing high performance coding systems. In particular, the recent success of turbo codes indicates that performance close to the Shannon limit may be achieved. In this thesis, it is showed that many iterative decoding algorithm ..."
Abstract

Cited by 359 (1 self)
 Add to MetaCart
Iterative decoding techniques have become a viable alternative for constructing high performance coding systems. In particular, the recent success of turbo codes indicates that performance close to the Shannon limit may be achieved. In this thesis, it is showed that many iterative decoding
Results 1  10
of
4,705