Breeann M. Flesch
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Breeann M. Flesch has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- David E. Brown
Utah State University
2 shared publications - Larry J. Langley
University of the Pacific
2 shared publications Columbia University
1 shared publication- Dane Miyata
Columbia University Western Oregon University Willamette University Willamette University University of Oregon
1 shared publication David E. Brown
Department of Mathematics and Statistics, Utah State University, Logan, UT 84322, USA
1 shared publication- Erin McNicholas
Willamette University
1 shared publication
Latest Publications
- Open Access
- 1 January 2024
- Published by Georgia Southern University in Theory and Applications of Graphs
- Vol. 11 (1) , 1-14
Approval Gap of Weighted k-Majority Tournaments
A $k$-majority tournament $T$ on a finite set of vertices $V$ is defined by a set of $2k-1$ linear orders on $V$, with an edge $u \to v$ in $T$ if $u>v$ in a majority of the linear orders. We think of the linear orders as voter preferences and the vertices of $T$ as candidates, with an edge $u \to v$ in $T$ if a majority of voters prefer candidate $u$ to candidate $v$. In this paper we introduce weighted $k$-majority tournaments, with each edge $u \to v$ weighted by the number of voters preferring $u$. We define the maximum approval gap $\gamma_w(T)$, a measure by which any dominating set of $T$ beats the next most popular candidate. This parameter is analogous to previous work on the size of minimum dominating sets of (unweighted) $k$-majority tournaments. We prove that $k/2 \leq \gamma_w(T) \leq 2k-1$ for any weighted $k$-majority tournament $T$, and construct tournaments with $\gamma_w(T)=q$ for any rational number $k/2 \leq q \leq 2k-1$. We also consider the minimum number of vertices $m(q,k)$ in a $k$-majority tournament with $\gamma_w(T)=q$.- 1 January 2024
- Published by Georgia Southern University in Theory and Applications of Graphs
- Vol. 11 (1) , 1-14
Open AccessApproval Gap of Weighted k-Majority Tournaments
A $k$-majority tournament $T$ on a finite set of vertices $V$ is defined by a set of $2k-1$ linear orders on $V$, with an edge $u \to v$ in $T$ if $u>v$ in a majority of the linear orders. We think of the linear orders as voter preferences and the vertices of $T$ as candidates, with an edge $u \to v$ in $T$ if a majority of voters prefer candidate $u$ to candidate $v$. In this paper we introduce weighted $k$-majority tournaments, with each edge $u \to v$ weighted by the number of voters preferring $u$. We define the maximum approval gap $\gamma_w(T)$, a measure by which any dominating set of $T$ beats the next most popular candidate. This parameter is analogous to previous work on the size of minimum dominating sets of (unweighted) $k$-majority tournaments. We prove that $k/2 \leq \gamma_w(T) \leq 2k-1$ for any weighted $k$-majority tournament $T$, and construct tournaments with $\gamma_w(T)=q$ for any rational number $k/2 \leq q \leq 2k-1$. We also consider the minimum number of vertices $m(q,k)$ in a $k$-majority tournament with $\gamma_w(T)=q$. - 17 November 2017
- Published by Springer Nature in Order
- Vol. 35 (3) , 495-514
Interval k-Graphs and Orders
- 17 November 2017
- Published by Springer Nature in Order
- Vol. 35 (3) , 495-514
Interval k-Graphs and Orders
- Open Access
Interval k-Graphs and Orders
An interval $k$-graph is the intersection graph of a family $\mathcal{I}$ of intervals of the real line partitioned into at most $k$ classes with vertices adjacent if and only if their corresponding intervals intersect and belong to different classes. In this paper we discuss the interval $k$-graphs that are the incomparability graphs of orders; i.e., cocomparability interval $k$-graphs or interval $k$-orders. Interval $2$-orders have been characterized in many ways, but we show that analogous characterizations do not carry over to interval $k$-orders, for $k > 2$. We describe the structure of interval $k$-orders, for any $k$, characterize the interval $3$-orders (cocomparability interval $3$-graphs) via one forbidden suborder (subgraph), and state a conjecture for interval $k$-orders (any $k$) that would characterize them via two forbidden suborders.Open AccessInterval k-Graphs and Orders
An interval $k$-graph is the intersection graph of a family $\mathcal{I}$ of intervals of the real line partitioned into at most $k$ classes with vertices adjacent if and only if their corresponding intervals intersect and belong to different classes. In this paper we discuss the interval $k$-graphs that are the incomparability graphs of orders; i.e., cocomparability interval $k$-graphs or interval $k$-orders. Interval $2$-orders have been characterized in many ways, but we show that analogous characterizations do not carry over to interval $k$-orders, for $k > 2$. We describe the structure of interval $k$-orders, for any $k$, characterize the interval $3$-orders (cocomparability interval $3$-graphs) via one forbidden suborder (subgraph), and state a conjecture for interval $k$-orders (any $k$) that would characterize them via two forbidden suborders. - Open Access
- 23 February 2014
- Published by Hindawi Limited in Journal of Discrete Mathematics
- Vol. 2014, 1-7
A Characterization of 2-Tree Proper Interval 3-Graphs
An interval p-graph is the intersection graph of a collection of intervals which have been colored with p different colors with edges corresponding to nonempty intersection of intervals from different color classes. We characterize the class of 2-trees which are interval 3-graphs via a list of three graphs and three infinite families of forbidden induced subgraphs.
- 23 February 2014
- Published by Hindawi Limited in Journal of Discrete Mathematics
- Vol. 2014, 1-7
Open AccessA Characterization of 2-Tree Proper Interval 3-Graphs
An interval p-graph is the intersection graph of a collection of intervals which have been colored with p different colors with edges corresponding to nonempty intersection of intervals from different color classes. We characterize the class of 2-trees which are interval 3-graphs via a list of three graphs and three infinite families of forbidden induced subgraphs.