Clique numbers of graphs and irreducible exact \(m\)-covers of the integers

DOI10.1016/j.aam.2008.09.004zbMath1162.05325OpenAlexW2053630367MaRDI QIDQ1023392

Hao Pan, Li Lu Zhao

Publication date: 11 June 2009

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2008.09.004

zbMATH Keywords

induced subgraphClique numberexact \(m\)-cover of \(\mathbb Z\)

Mathematics Subject Classification ID

Applications of graph theory (05C90) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20) Arithmetic progressions (11B25)

Related Items (2)

ON m-COVERS AND m-SYSTEMS ⋮ A NOTE ON THE SUM OF RECIPROCALS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zero-sum problems for abelian \(p\)-groups and covers of the integers by residue classes
• On exactly \(m\) times covers
• On integers of the forms \(k^r-2^n\) and \(k^r2^n+1\).
• Roots of unity and covering sets
• On odd covering systems with distinct moduli
• Covering systems and generating functions
• Graph Theory and Probability
• Improvements to the Newman-Znám result for disjoint covering systems
• Necessary conditions for distinct covering systems with square-free moduli
• Regular coverings of the integers by arithmetic progressions
• Covering the integers by arithmetic sequences. II
• On properties of systems of arithmetic sequences
• On covering multiplicity
• Exact m-covers and the linear form $∑^k_{s=1} x_s/n_s$
• On m times covering systems of congruences
• Covering the integers by arithmetic sequences
• On integers not of the form ±𝑝^{𝑎}±𝑞^{𝑏}
• A sharp result on $m$-covers
• Sur le coloriage des graphs

This page was built for publication: Clique numbers of graphs and irreducible exact \(m\)-covers of the integers