quasikernel
arxiv.org · 10,855 words · saved by 1 readers
N/A
Generalized Quasikernels in Digraphs Sam Spiro∗ arXiv:2404.07305v2 [math.CO] 18 Jul 2024 July 19, 2024 Abstract Given a digraph D, we say that a set of vertices Q ⊆ V (D) is a q-kernel if Q is an independent set and if…
saved by
related reading
- 2-reachable subsets in two-colored graphsarxiv.org
- balogh containersarxiv.org
- nullstellensatzweb.math.princeton.edu
- 02_GyarfasLehel_AHellyTypeProblemInTrees.pdfusers.renyi.hu
- parity edge coloringmilans.us
- [2604.27639] How large part of a graph can be covered by the neighborhoods of k vertices?arxiv.org
- piercing intervals - gyarfasarxiv.org
- [2604.06521] The Exact Saturation Number for the Diamondarxiv.org
- Sublinear expandersias.edu
- Exact Stability for Turan's Theoremarxiv.org
- Forbidding Exactly One Hamming Distancearxiv.org
- rainbow-turan-full-version.pdfpeople.maths.ox.ac.uk