On chromatic number of graphs and set-systems

@article{Erdos1966OnCN,
  title={On chromatic number of graphs and set-systems},
  author={Paul L. Erdos and Andr{\'a}s Hajnal},
  journal={Acta Mathematica Academiae Scientiarum Hungarica},
  year={1966},
  volume={17},
  pages={61-99}
}
  • P. Erdos, A. Hajnal
  • Published 1 March 1966
  • Mathematics
  • Acta Mathematica Academiae Scientiarum Hungarica
The list-chromatic number and the coloring number of uncountable graphs
We study the list-chromatic number and the coloring number of graphs, especially uncountable graphs. We show that the coloring number of a graph coincides with its list-chromatic number provided that
Reverse Mathematics and the Coloring Number of Graphs
TLDR
Methods of reverse mathematics are used to analyze the proof theoretic strength of a theorem involving the notion of coloring number, stating that if a graph is the union of n forests, then the coloring number of the graph is at most 2n.
Colouring problems of Erdos and Rado on infinite graphs
Colouring problems of Erdős and Rado on infinite graphs Dániel T. Soukup Doctor of Philosophy Graduate Department of Mathematics University of Toronto 2015 The aim of this thesis is to provide
Universality in Graph Properties with Degree Restrictions
TLDR
A k-degenerate graph is constructed which is universal for the induced-hereditary property of finite k- Degenerate graphs and the notion of a property with assignment is introduced and studied.
Good point sequencings of Steiner triple systems
An ℓ -good sequencing of a Steiner triple system of order v , STS( v ), is a permutation of the points of the system such that no ℓ consecutive points in the permutation contains a block. It is known
Constructions of infinite graphs with Ramsey property
For every infinite cardinal λ and 2 ≤ n < ω there is a directed graph D of size λ such that D does not contain directed circuits of length ≤n and if its vertices are colored with
Geometric Set Theory
INFINITE COMBINATORICS PLAIN AND SIMPLE
TLDR
The main purpose is to demonstrate the ease and wide applicability of the general method based on trees of elementary submodels in a form accessible to anyone with a basic background in set theory and logic.
Orientations of graphs with uncountable chromatic number
TLDR
It is proved that consistently there are digraphs with uncountable dichromatic number and arbitrarily large digirth; this is in surprising contrast with the undirected case: any graph with unccountable chromatic number contains a 4-cycle.
A note on generalized chromatic number and generalized girth
...
...

References

SHOWING 1-10 OF 28 REFERENCES
Graph Theory and Probability
  • P. Erdös
  • Mathematics
    Canadian Journal of Mathematics
  • 1959
A well-known theorem of Ramsay (8; 9) states that to every n there exists a smallest integer g(n) so that every graph of g(n) vertices contains either a set of n independent points or a complete
Sur le coloriage des graphs
Regularity and Positional Games
1.Introduction. Suppose X is a set, 𝒞 a collection of sets (usually subsets of X), and N is cardinal number. Following the terminology of Rado [1], we say 𝒞 is N-regular in X if,for any partition
...
...