Complete subgraphs of the coprime hypergraph of integers. I: Introduction and bounds

DOI10.1007/s40879-017-0137-5zbMath1374.11034OpenAlexW2601054371MaRDI QIDQ1677181

Jan-Hendrik de Wiljes

Publication date: 10 November 2017

Published in: European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40879-017-0137-5

zbMATH Keywords

clique numberdegree sequencehypergraphs on integers

Mathematics Subject Classification ID

Hypergraphs (05C65) Other combinatorial number theory (11B75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

A note on prime labeling \(k\)-partite \(k\)-graphs ⋮ Complete subgraphs of the coprime hypergraph of integers. III: Construction ⋮ Complete subgraphs of the coprime hypergraph of integers. II: Structural properties ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Primality of trees
• Complete tripartite subgraph in the coprime graphs of integers
• On cycles in the coprime graph of integers
• A note on a theorem of Erdős and Gallai
• On Newman's Conjecture and Prime Trees
• On the Kernel of the Coprime Graph of Integers
• Proof of D. J. Newman's coprime mapping conjecture
• The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
• On extremal sets without coprimes
• Maximal sets of numbers not containing k+1 pairwise coprime integers
• Sets of integers and quasi-integers with pairwise common divisor
• Sets of integers with pairwise common divisor and a factor from a specified set of primes

This page was built for publication: Complete subgraphs of the coprime hypergraph of integers. I: Introduction and bounds