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

DOI10.1007/S40879-017-0137-5MaRDI QIDQ1677181zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Complete subgraphs of the coprime hypergraph of integers. II: Structural properties
• Complete subgraphs of the coprime hypergraph of integers. III: Construction
• Subgraphs of coprime graphs on sets of consecutive integers
• Complete tripartite subgraph in the coprime graphs of integers
• Bounds on the number of complete subgraphs
• Cycles in the coprime hypergraph of integers
• scientific article; zbMATH DE number 3188526
• On the kernel of the coprime graph of integers
• On cycles in the coprime graph of integers
• On generalized coprime graphs

Cites work

• scientific article; zbMATH DE number 3169205 (Why is no real title available?)
• scientific article; zbMATH DE number 3206365 (Why is no real title available?)
• A note on a theorem of Erdős and Gallai
• Complete tripartite subgraph in the coprime graphs of integers
• Graph theory
• Maximal sets of numbers not containing k+1 pairwise coprime integers
• On Newman's Conjecture and Prime Trees
• On cycles in the coprime graph of integers
• On extremal sets without coprimes
• On generalized coprime graphs
• On the kernel of the coprime graph of integers
• Primality of trees
• Proof of D. J. Newman's coprime mapping conjecture
• 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
• The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2

Cited in

(8)

• Complete subgraphs of the coprime hypergraph of integers. II: Structural properties
• A note on prime labeling \(k\)-partite \(k\)-graphs
• On the kernel of the coprime graph of integers
• On generalized coprime graphs
• Complete subgraphs of the coprime hypergraph of integers. III: Construction
• Subgraphs of coprime graphs on sets of consecutive integers
• Cycles in the coprime hypergraph of integers
• On coprime percolation, the visibility graphon, and the local limit of the GCD profile

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1677181)