3 problems

Let $O_n$ denote the odd graph with parameter $n\geq 2$. A graph is TB-symmetrical when its total Thurston–Bennequin number admits the symmetry described in the paper. Odd-graph TB…

For a strongly invertible Legendrian knot, let its Thurston–Bennequin number be denoted by $\operatorname{tb}$, let $\overline{\operatorname{tb}}(K)$ be the maximal Thurston–Benneq…

Let $K_5$ be the complete graph on five vertices, and consider an unknotted minimal embedding of $K_5$ as a Legendrian graph. For each $5$-cycle in the embedding, let $tb$ denote i…