Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
131 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Geodetic convexity and Kneser graphs (2203.03406v2)

Published 7 Mar 2022 in math.CO and cs.DM

Abstract: The {\em Kneser graph} $K(2n+k,n)$, for positive integers $n$ and $k$, is the graph $G=(V,E)$ such that $V={S\subseteq{1,\ldots,2n+k} : |S|=n}$ and there is an edge $uv\in E$ whenever $u\cap v=\emptyset$. Kneser graphs have a nice combinatorial structure, and many parameters have been determined for them, such as the diameter, the chromatic number, the independence number, and, recently, the hull number (in the context of $P_3$-convexity). However, the determination of geodetic convexity parameters in Kneser graphs still remained open. In this work, we investigate both the geodetic number and the geodetic hull number of Kneser graphs. We give upper bounds and determine the exact value of these parameters for Kneser graphs of diameter two (which form a nontrivial subfamily). We prove that the geodetic hull number of a Kneser graph of diameter two is two, except for $K(5,2)$, $K(6,2)$, and $K(8,2)$, which have geodetic hull number three. We also contribute to the knowledge on Kneser graphs by presenting a characterization of endpoints of diametral paths in $K(2n+k,n)$, used as a tool for obtaining some of the main results in this work.

Citations (2)

Summary

We haven't generated a summary for this paper yet.