Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: More non-bipartite forcing pairs   We study pairs of graphs (H_1,H_2) such that every graph with the densities
of H_1 and H_2 close to the densities of H_1 and H_2 in a random graph is
quasirandom; such pairs (H_1,H_2) are called forcing. Non-bipartite forcing
pairs were first discovered by Conlon, Han, Person and Schacht [Weak
quasi-randomness for uniform hypergraphs, Random Structures Algorithms 40
(2012), 1-38]: they showed that (K_t,F) is forcing where F is the graph that
arises from K_t by iteratively doubling its vertices and edges in a prescribed
way t times. Reiher and Schacht [Forcing quasirandomness with triangles, Forum
of Mathematics, Sigma 7, 2019] strengthened this result for t=3 by proving that
two doublings suffice and asked for the minimum number of doublings needed for
t>3. We show that (t+2)/2 doublings always suffice.

11
The categories of this paper are: hep-lat
37
The categories of this paper are: supr-con
31
The categories of this paper are: ao-sci
4
The categories of this paper are: cond-mat
19
The categories of this paper are: eess
7
The categories of this paper are: hep-th
12
The categories of this paper are: nucl-th
28
The categories of this paper are: alg-geom
13
The categories of this paper are: quant-ph
9
The categories of this paper are: nlin
33
The categories of this paper are: plasm-ph
23
The categories of this paper are: solv-int
16
The categories of this paper are: stat
32
The categories of this paper are: atom-ph
36
The categories of this paper are: cmp-lg
18
The categories of this paper are: econ