Complete tripartite subgraph in the coprime graphs of integers

DOI10.1016/S0012-365X(98)00359-8zbMath0995.11015OpenAlexW2151336588WikidataQ126758656 ScholiaQ126758656MaRDI QIDQ1301717

Gábor N. Sárközy

Publication date: 29 November 1999

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00359-8

zbMATH Keywords

combinatorial number theorygraphs on integers

Mathematics Subject Classification ID

Paths and cycles (05C38) Other combinatorial number theory (11B75) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

Complete subgraphs of the coprime hypergraph of integers. I: Introduction and bounds ⋮ Unnamed Item ⋮ Minimum coprime graph labelings ⋮ Hamiltonicity of a coprime graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Arithmetical properties of permutations of integers
• On cycles in the coprime graph of integers
• Study of the divisor graph. I
• Proof of D. J. Newman's coprime mapping conjecture
• 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
• Coprime mappings between sets of consecutive integers
• Some remarks about additive and multiplicative functions

This page was built for publication: Complete tripartite subgraph in the coprime graphs of integers