NDLTD logo NDLTD Union Catalog and Global ETD Search

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 2 of 2 for “"k-majority tournaments"”.

  1. Extremal problems on edge-colorings, independent sets, and cycle spectra of graphs

    Milans, Kevin G.University of Illinois at Urbana-Champaign2010

    … results on the size of maximum acyclic sets in k-majority tournaments. In Chapter 8, we prove a lower bound on the size of the cycle spectra of Hamiltonian graphs.

    uiuc Repository record

  2. REALIZING TOURNAMENTS AS MODELS FOR K-MAJORITY VOTING

    Cheney, Gina Marie2016

    <p>A <em>k</em>-majority tournament is a directed graph that models a <em>k</em>-majority voting scenario, which is realized by 2<em>k</em> - 1 rankings, called linear orderings, of the vertices in the tournament. Every <em>k</em>-majority voting scenario can be modeled by a tournament, but not …

    csusb Repository record