On the determining number of Kneser graphs

Abstract: The determining number of a graph $G = (V,E)$ is the minimum cardinality of a set $S\subseteq V$ such that pointwise stabilizer of $S$ under the action of $Aut(G)$ is trivial. In this talk, we will discuss on some improved upper and lower bounds on the determining number of Kneser graphs. Moreover, we provide the exact value of the determining number for some subfamilies of Kneser graphs. Finally, we show that the number of Kneser graphs with a given determining number $r$ is an increasing function of $r$.

commutative algebraalgebraic topologycombinatorics

Audience: researchers in the topic

Applications of Combinatorics in Algebra, Topology and Graph Theory

Series comments: To get email notification of the upcoming talk in this series, please subscribe to the mailing list or contact one of the organizers. Please visit webinar webpage for information about forthcoming and previous webinars. Thank you!