Infinite end-devouring sets of rays with prescribed start vertices
- Resource Type
- Authors
- Karl Heuer; J. Pascal Gollin
- Source
- Discrete Mathematics. 341:2117-2120
- Subject
- Discrete mathematics
Conjecture
Astrophysics::High Energy Astrophysical Phenomena
010102 general mathematics
Feasible region
Disjoint sets
01 natural sciences
Graph
Theoretical Computer Science
Combinatorics
0103 physical sciences
Discrete Mathematics and Combinatorics
010307 mathematical physics
0101 mathematics
Mathematics
- Language
- ISSN
- 0012-365X
We prove that every end of a graph contains either uncountably many disjoint rays or a set of disjoint rays that meet all rays of the end and start at any prescribed feasible set of start vertices. This confirms a conjecture of Georgakopoulos.