Quasi-kernels and quasi-sinks in infinite graphs
| dc.creator | Erdos, Peter L. | |
| dc.creator | Soukup, Lajos | |
| dc.date | 2007-12-05 | |
| dc.date.accessioned | 2026-07-07T08:47:25Z | |
| dc.date.available | 2026-07-07T08:47:25Z | |
| dc.description | Given a directed graph G=(V,E) an independent set A of the vertices V is called quasi-kernel (quasi-sink) iff for each point v there is a path of length at most 2 from some point of A to v (from v to some point of A). Every finite directed graph has a quasi-kernel. The plain generalization for infinite graphs fails, even for tournaments. We investigate the following conjecture here: for any digraph G=(V,E) there is a a partition (V_0,V_1) of the vertex set such that the induced subgraph G[V_0] has a quasi-kernel and the induced subgraph G[V_1] has a quasi-sink. | |
| dc.identifier | https://arxiv.org/abs/0712.0663 | |
| dc.identifier | http://arxiv.org/abs/0712.0663 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/143590 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C20 (Primary); 05C69 (Secondary) | |
| dc.title | Quasi-kernels and quasi-sinks in infinite graphs | |
| dc.type | text |