Degree constrained orientations in countable graphs (Q1010857)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5541027
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Degree constrained orientations in countable graphs |
scientific article; zbMATH DE number 5541027 |
Statements
Degree constrained orientations in countable graphs (English)
0 references
7 April 2009
0 references
Summary: Degree constrained orientations are orientations of an (undirected) graph where the in-degree function satisfies given lower and upper bounds. For finite graphs, \textit{A. Frank} and \textit{A. Gyárfás} [``How to orient the edges of a graph?'', Combinatorics, Keszthely 1976, Colloq. Math. Soc. Janos Bolyai 18, 353--364 (1978; Zbl 0389.05035)] gave a necessary and sufficient condition for the existence of such an orientation. We extend their result to countable graphs.
0 references
degree constrained orientations
0 references
indegree function
0 references
lower bound
0 references
upper bound
0 references
countable graphs
0 references
0.7819350361824036
0 references
0.7549816966056824
0 references
0.7435963749885559
0 references
0.7377097010612488
0 references
