English

Complete Subgraphs of the Coprime Hypergraph of Integers III: Construction

Number Theory 2019-10-22 v1 Combinatorics

Abstract

The coprime hypergraph of integers on nn vertices CHIk(n)CHI_k(n) is defined via vertex set {1,2,,n}\{1,2,\dots,n\} and hyperedge set {{v1,v2,,vk+1}{1,2,,n}:gcd(v1,v2,,vk+1)=1}\{\{v_1,v_2,\dots,v_{k+1}\}\subseteq\{1,2,\dots,n\}:\gcd(v_1,v_2,\dots,v_{k+1})=1\}. In this article we present ideas on how to construct maximal subgraphs in CHIk(n)CHI_k(n). This continues the author's earlier work, which dealt with bounds on the size and structural properties of these subgraphs. We succeed in the cases k{1,2,3}k\in\{1,2,3\} and give promising ideas for k4k\geq 4.

Keywords

Cite

@article{arxiv.1708.03785,
  title  = {Complete Subgraphs of the Coprime Hypergraph of Integers III: Construction},
  author = {Jan-Hendrik de Wiljes},
  journal= {arXiv preprint arXiv:1708.03785},
  year   = {2019}
}

Comments

6 pages, 1 figure