Clique Numbers of Graphs and Irreducible Exact m-Covers of Z
From MaRDI portal
Publication:6209022
arXiv0804.0901MaRDI QIDQ6209022FDOQ6209022
Publication date: 6 April 2008
Abstract: For each m>=1 and k>=2, we construct a graph G=(V,E) with omega(G)=m such that max_{1leq ileq k} omega(G[V_i])=m for arbitrary partition V=V_1cup...cup V_k, where omega(G) is the clique number of G and G[V_i] is the induced subgraph of G with the vertex set V_i. Using this result, we show that for each m>=2 there exists an exact m-cover of Z which is not the union of two 1-covers.
Applications of graph theory (05C90) Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30) Arithmetic progressions (11B25)
This page was built for publication: Clique Numbers of Graphs and Irreducible Exact m-Covers of Z
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6209022)
