<p>Let <i>q</i> be an odd power of a prime <i>p</i>, and <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(S \subseteq \mathbb {F}_q^*\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>S</mi> <mo>⊆</mo> <msubsup> <mi mathvariant="double-struck">F</mi> <mi>q</mi> <mo>∗</mo> </msubsup> </mrow> </math></EquationSource> </InlineEquation> such that <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(S=-S\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>S</mi> <mo>=</mo> <mo>-</mo> <mi>S</mi> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(S/S \ne \mathbb {F}_q^*\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>S</mi> <mo stretchy="false">/</mo> <mi>S</mi> <mo>≠</mo> <msubsup> <mi mathvariant="double-struck">F</mi> <mi>q</mi> <mo>∗</mo> </msubsup> </mrow> </math></EquationSource> </InlineEquation>. We show that the clique number of the Cayley graph <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(\operatorname {Cay}(\mathbb {F}_q^+,S)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo>Cay</mo> <mo stretchy="false">(</mo> <msubsup> <mi mathvariant="double-struck">F</mi> <mi>q</mi> <mo>+</mo> </msubsup> <mo>,</mo> <mi>S</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> is at most <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(\sqrt{|S/S|}+\sqrt{q/p}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msqrt> <mrow> <mo stretchy="false">|</mo> <mi>S</mi> <mo stretchy="false">/</mo> <mi>S</mi> <mo stretchy="false">|</mo> </mrow> </msqrt> <mo>+</mo> <msqrt> <mrow> <mi>q</mi> <mo stretchy="false">/</mo> <mi>p</mi> </mrow> </msqrt> </mrow> </math></EquationSource> </InlineEquation>, improving the best-known <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(\sqrt{q}\)</EquationSource> <EquationSource Format="MATHML"><math> <msqrt> <mi>q</mi> </msqrt> </math></EquationSource> </InlineEquation> upper bound for many families of such graphs substantially. Such a new bound is strongest for cyclotomic graphs and in particular, it implies the first nontrivial upper bound on the clique number of all generalized Paley graphs of non-square order, extending the work of Hanson and Petridis. Moreover, our new bound is asymptotically sharp for an infinite family of generalized Paley graphs, and we further discover the first nontrivial family among them for which the clique number can be exactly determined. We also obtain a new lower bound on the number of directions determined by a large Cartesian product in the affine Galois plane <i>AG</i>(2,&#xa0;<i>q</i>), which is sharp for infinite families.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Exact values and improved bounds on the clique number of cyclotomic graphs

  • Chi Hoi Yip

摘要

Let q be an odd power of a prime p, and \(S \subseteq \mathbb {F}_q^*\) S F q such that \(S=-S\) S = - S and \(S/S \ne \mathbb {F}_q^*\) S / S F q . We show that the clique number of the Cayley graph \(\operatorname {Cay}(\mathbb {F}_q^+,S)\) Cay ( F q + , S ) is at most \(\sqrt{|S/S|}+\sqrt{q/p}\) | S / S | + q / p , improving the best-known \(\sqrt{q}\) q upper bound for many families of such graphs substantially. Such a new bound is strongest for cyclotomic graphs and in particular, it implies the first nontrivial upper bound on the clique number of all generalized Paley graphs of non-square order, extending the work of Hanson and Petridis. Moreover, our new bound is asymptotically sharp for an infinite family of generalized Paley graphs, and we further discover the first nontrivial family among them for which the clique number can be exactly determined. We also obtain a new lower bound on the number of directions determined by a large Cartesian product in the affine Galois plane AG(2, q), which is sharp for infinite families.