Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Independence and matching numbers of some token graphs   Let $G$ be a graph of order $n$ and let $k\in\{1,\ldots,n-1\}$. The $k$-token
graph $F_k(G)$ of $G$, is the graph whose vertices are the $k$-subsets of
$V(G)$, where two vertices are adjacent in $F_k(G)$ whenever their symmetric
difference is an edge of $G$. We study the independence and matching numbers of
$F_k(G)$. We present a tight lower bound for the matching number of $F_k(G)$
for the case in which $G$ has either a perfect matching or an almost perfect
matching. Also, we estimate the independence number for bipartite $k$-token
graphs, and determine the exact value for some graphs.

35
The categories of this paper are: mtrl-th
8
The categories of this paper are: hep-ex
34
The categories of this paper are: chem-ph
18
The categories of this paper are: econ
17
The categories of this paper are: q-fin
30
The categories of this paper are: q-alg
20
The categories of this paper are: acc-phys
15
The categories of this paper are: nucl-ex
24
The categories of this paper are: dg-ga
26
The categories of this paper are: bayes-an
29
The categories of this paper are: funct-an
36
The categories of this paper are: cmp-lg
22
The categories of this paper are: chao-dyn
28
The categories of this paper are: alg-geom
11
The categories of this paper are: hep-lat
21
The categories of this paper are: adap-org