𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower Bounds on the Transversal Numbers ofd-Intervals

✍ Scribed by J. Matoušek

Publisher
Springer
Year
2001
Tongue
English
Weight
46 KB
Volume
26
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Lower Bound on Unknotting Number*
A Lower Bound on Unknotting Number*
✍ Jiming Ma; Ruifeng Qiu 📂 Article 📅 2006 🏛 Coastal and Estuarine Research Federation 🌐 English ⚖ 141 KB
Further results on the lower bounds of m
Further results on the lower bounds of mean color numbers
✍ F. M. Dong 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB 👁 1 views

Let G be a graph with n vertices. The mean color number of G, denoted by (G), is the average number of colors used in all n-colorings of G. This paper proves that (G) ! (Q), where Q is any 2-tree with n vertices and G is any graph whose vertex set has an ordering x 1 ,x 2 , . . . ,x n such that x i

Lower bounds on the minus domination and
Lower bounds on the minus domination and k-subdomination numbers
✍ Liying Kang; Hong Qiao; Erfang Shan; Dingzhu Du 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 118 KB

A three-valued function f deÿned on the vertex set of a graph G = (V; E), f : V → {-1; 0; 1} is a minus dominating function if the sum of its function values over any closed neighborhood is at least one. That is, for every consists of v and all vertices adjacent to v. The weight of a minus function

New Lower Bounds on the Multicolor Ramse
New Lower Bounds on the Multicolor Ramsey Numbers rk(C4)
✍ Felix Lazebnik; Andrew J. Woldar 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 85 KB

The multicolor Ramsey number r k (C 4 ) is the smallest integer n for which any k-coloring of the edges of the complete graph K n must produce a monochromatic 4-cycle. It was proved earlier that r k (C 4 ) k 2 &k+2 for k&1 being a prime power. In this note we establish r k (C 4 ) k 2 +2 for k being

Tidier Examples for Lower Bounds on Diag
Tidier Examples for Lower Bounds on Diagonal Ramsey Numbers
✍ Colin McDiarmid; Angelika Steger 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 266 KB

There is a family (H k ) of graphs such that H k has order (1+o(1))(-2Âe) k 2 kÂ2 but has no clique or stable set of order k. This result of Spencer provides the best known lower bound for the diagonal Ramsey numbers R(k, k). Here we see that the graphs H k can be taken to be regular, self-complemen