Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Kneser Graphs"”.

  1. Hamiltonian cycles in subset and subspace graphs.

    … and the uniform-Hamiltonicity of subset graphs, subspace graphs, and their associated bipartite graphs. In 1995 paper "The Subset-Subspace Analogy," Kung states the subspace version of a conjecture. The study of this problem led to a more general class of graphs. Inspired by Clark and …

    unt Repository record for Hamiltonian cycles in subset and subspace graphs. (opens in a new tab)

  2. The Koszul dual to n-Lie, n-Com algebras, and Young tableaux

    … which arise from the eigenspaces of the general Kneser graphs $\cO_{n,s}$, where the operads $n\text{-}Lie$ ($n\text{-}Com)$ and $Lie_n^d$ ($Com_n^d)$ appear on different sides of the spectrum based on the parameter $s$. With the introduction of the new class of $n$-Com algebras through the …

    washington Repository record for The Koszul dual to n-Lie, n-Com algebras, and Young tableaux (opens in a new tab)

  3. Topics In Probabilistic Combinatorics

    … Stirling numbers. Chapter 5 introduces the Kneser Graph. The exact expected value and variance of the distance between [n] and a vertex chosen uniformly at random is given. An asymptotic formula for the expectation is found.

    siu-theses Repository record for Topics In Probabilistic Combinatorics (opens in a new tab)