✦ LIBER ✦

Local and Global Clique Numbers

✍ Scribed by N. Linial; Y. Rabinovich

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 416 KB
Volume: 61
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1994.1026

No coin nor oath required. For personal study only.

✦ Synopsis

Consider a graph (G) with the property that any set of (p) vertices in (G) contains a (q)-clique. Fairly tight lower bounds are proved on the clique number of (G) as a function of (p, q) and the number of vertices in (G). 1994 Academic Press, Inc.

📜 SIMILAR VOLUMES

On local connectivity of graphs with giv

On local connectivity of graphs with given clique number

✍ Andreas Holtkamp; Lutz Volkmann 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB

## Abstract For a vertex __v__ of a graph __G__, we denote by __d__(__v__) the __degree__ of __v__. The __local connectivity__ κ(__u, v__) of two vertices __u__ and __v__ in a graph __G__ is the maximum number of internally disjoint __u__ –__v__ paths in __G__, and the __connectivity__ of __G__ is

Independence number and clique minors

✍ Ken-ichi Kawarabayashi; Zi-Xia Song 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

## Abstract The Hadwiger number ${h}({G})$ of a graph __G__ is the maximum integer __t__ such that ${K}\_{t}$ is a minor of __G__. Since $\chi({G})\cdot\alpha({G})\geq |{G}|$, Hadwiger's conjecture implies that ${h}({G})\cdot \alpha({G})\geq |{G}|$, where $\alpha({G})$ and $|{G}|$ denote the indepe

Local, global, and elementary stoichiome

Local, global, and elementary stoichiometry

✍ Brian G. Higgins; Stephen Whitaker 📂 Article 📅 2011 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 680 KB

Global-local finite element

✍ C. D. Mote Jr. 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 390 KB

Local and Mean Ramsey Numbers for Trees

✍ B. Bollobás; A. Kostochka; R.H. Schelp 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 75 KB

In this note we find the local and mean k-Ramsey numbers for many trees for which the Erdo s So s tree conjecture holds. ## 2000 Academic Press The usual Ramsey number R(G, k) is the smallest positive integer n such that any coloring of the edges of K n by at most k colors contains a monochromatic

Fractional chromatic number and circular

Fractional chromatic number and circular chromatic number for distance graphs with large clique size

✍ Daphne Der-Fen Liu; Xuding Zhu 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

## Abstract An Erratum has been published for this article in Journal of Graph Theory 48: 329–330, 2005. Let __M__ be a set of positive integers. The distance graph generated by __M__, denoted by __G__(__Z, M__), has the set __Z__ of all integers as the vertex set, and edges __ij__ whenever |__i__