Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Acyclic Subgraphs in $k$-Majority Tournaments   A $k$-majority digraph is a directed graph created by combining $k$
individual rankings on the same ground set to form a consensus where edges
point in the direction indicated by a strict majority of the rankings. The
$k$-majority digraph is used to model voting scenarios, where the vertices
correspond to options ranked by $k$ voters. When $k$ is odd, the resulting
digraph is always a tournament, called $k$-majority tournament. Let $f_k(n)$ be
the minimum, over all $k$-majority tournaments with $n$ vertices, of the
maximum order of an induced transitive sub-tournament. Recently, Milans,
Schreiber, and West proved that $\sqrt n \le f_3(n) \le 2 \sqrt n +1 $. In this
paper, we improve the upper bound of $f_3(n)$ by showing that $f_3(n) < \sqrt
{2n} +\frac 12 $.

7
The categories of this paper are: hep-th
23
The categories of this paper are: solv-int
33
The categories of this paper are: plasm-ph
0
The categories of this paper are: hep-ph
1
The categories of this paper are: cs
24
The categories of this paper are: dg-ga
36
The categories of this paper are: cmp-lg
15
The categories of this paper are: nucl-ex
19
The categories of this paper are: eess
11
The categories of this paper are: hep-lat
32
The categories of this paper are: atom-ph
21
The categories of this paper are: adap-org
31
The categories of this paper are: ao-sci
37
The categories of this paper are: supr-con
9
The categories of this paper are: nlin
29
The categories of this paper are: funct-an