Complete Subgraphs of the Coprime Hypergraph of Integers III: Construction
Abstract
The coprime hypergraph of integers on n vertices CHIk(n) is defined via vertex set \1,2,…,n\ and hyperedge set \\v1,v2,…,vk+1\⊂eq\1,2,…,n\:(v1,v2,…,vk+1)=1\. In this article we present ideas on how to construct maximal subgraphs in CHIk(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\ and give promising ideas for k≥ 4.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.