Complete Subgraphs of the Coprime Hypergraph of Integers III: Construction
Number Theory
2019-10-22 v1 Combinatorics
Abstract
The coprime hypergraph of integers on vertices is defined via vertex set and hyperedge set . In this article we present ideas on how to construct maximal subgraphs in . 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 and give promising ideas for .
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