Results on extremal graph theoretic questions for \(q\)-ary vectors (Q6548035)

A \(q\)-graph with \(e\) edges and \(n\) vertices is defined as an \(e \times n\) matrix with entries from \(\{0,\ldots, q\}\), such that each row of the matrix, called a \(q\)-edge, contains exactly two nonzero entries. If \(H\) is a \(q\)-graph, then \(H\) is said to contain an \(s\)-copy of the ordinary graph \(F\), if a set \(S\) of \(q\)-edges can be selected from \(H\) such that their intersection graph is isomorphic to \(F\), and for any vertex \(v\) of \(S\) and any two incident edges \(e, f \in S\) the sum of the entries of \(e\) and \(f\) is at least \(s\). The extremal number ex(\(n, F, q, s\)) is defined as the maximal number of edges in an \(n\)-vertex \(q\)-graph such that it does not contain an \(s\)-copy of the forbidden graph \(F\). The authors establish that for every graph \(F\) and even \(q\), it suffices to examine the \(q = 2\) case, and determine the asymptotics of ex(\(n, C_{2k+1}, q, q + 1\)).