Complete subgraphs of the coprime hypergraph of integers. III: Construction
From MaRDI portal
(Redirected from Publication:2010414)
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 .
Recommendations
- Complete subgraphs of the coprime hypergraph of integers. I: Introduction and bounds
- Complete subgraphs of the coprime hypergraph of integers. II: Structural properties
- Cycles in the coprime hypergraph of integers
- Complete tripartite subgraph in the coprime graphs of integers
- On generalized coprime graphs
Cites work
Cited in
(4)
This page was built for publication: Complete subgraphs of the coprime hypergraph of integers. III: Construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010414)