Results on Extremal Graph Theoretic Questions for Q-Ary Vectors

A 𝑞-graph with 𝑒 edges and 𝑛 vertices is defined as an 𝑒 × 𝑛 matrix with entries from {0, … , 𝑞}, such that each row of the matrix (called a 𝑞-edge) contains exactly two nonzero entries. If 𝐻 is a 𝑞-graph, then 𝐻 is said to contain an 𝑠-copy of the ordinary graph 𝐹, if a set 𝑆 of 𝑞-edges can be selected from 𝐻 such that their intersection graph is isomorphic to 𝐹, and for any vertex 𝑣 of 𝑆 and any two incident edges 𝑒, 𝑓 ∈ 𝑆 the sum of the entries of 𝑒 and 𝑓 is at least 𝑠. The extremal number ex(𝑛, 𝐹, 𝑞, 𝑠) is defined as the maximal number of edges in an 𝑛-vertex 𝑞-graph such that it does not contain contain an 𝑠-copy of the forbidden graph 𝐹. In the present paper, we reduce the problem of finding ex(𝑛, 𝐹, 𝑞, 𝑞 + 1) for even 𝑞 to the case 𝑞 = 2, and determine the asymptotics of ex(𝑛, 𝐶 2𝑘+1 , 𝑞, 𝑞 + 1).