Searcharxiv⌕ Search

arXiv subjects

Maria Klawe

Publications and source records attributed to Maria Klawe.

3 recordsLinked to original sources

Ramsey Numbers of Most Even-Linked Double Stars

For $n \geq m$, the linked double star $S_c(n, m)$ is the graph formed by taking two disjoint stars $K_{1, n}$ and $K_{1, m}$ and linking their centers with a path on $c$ vertices. In this paper, we investigate the Ramsey numbers of even-linked double stars, that is, where $c = 2p$ for some $p \in \mathbb{N}$. Determining the Ramsey numbers of the $p = 1$ case (classical double stars) is a longstanding open question; the $p = 2$ case was resolved by Burr and Erdős in 1976, and Liu and Chen made progress for general even-linked double stars in 2026. We extend Burr and Erdős' formula for $p = 2$, proving that the Ramsey number of $S_{2p}(n, m)$ is given by \[r(S_{2p}(n, m)) = \max(2n + 2p - 1, n + 2m + 3p - 1),\]when $m \geq p -2 \geq 0$. Our upper bound argument hinges upon the existence (or nonexistence) of an object that we call a polarized pair. We also establish a matching lower bound that applies for all $n, m, p \geq 2$, and as such, we conjecture that this formula applies for all even-linked double stars where $p \geq 2$.

math.CO↗

On the Ramsey Numbers of Odd-Linked Double Stars

The linked double star $S_c(n,m)$, where $n \geq m \geq 0$, is the graph consisting of the union of two stars $K_{1,n}$ and $K_{1,m}$ with a path on $c$ vertices joining the centers. Its ramsey number $r(S_c(n,m))$ is the smallest integer $r$ such that every $2$-coloring of the edges of a $K_r$ admits a monochromatic $S_c(n,m)$. In this paper, we study the ramsey numbers of linked double stars when $c$ is odd. In particular, we establish bounds on the value of $r(S_c(n,m))$ and determine the exact value of $r(S_c(n,m))$ if $n \geq c$, or if $n \leq \lfloor \frac{c}{2} \rfloor - 2$ and $m = 2$.

math.CO↗

Double-interval societies

Consider a society of voters, each of whom specify an approval set over a linear political spectrum. We examine double-interval societies, in which each person's approval set is represented by two disjoint closed intervals, and study this situation where the approval sets are pairwise-intersecting: every pair of voters has a point in the intersection of their approval sets. The approval ratio for a society is, loosely speaking, the popularity of the most popular position on the spectrum. We study the question: what is the minimal guaranteed approval ratio for such a society? We provide a lower bound for the approval ratio, and examine a family of societies that have rather low approval ratios. These societies arise from double-n strings: arrangements of n symbols in which each symbol appears exactly twice.

math.CO↗