• 沒有找到結果。

681 "NOTE STEPHAN BRANDT: On the structure of graphs with bounded clique number 693

N/A
N/A
Protected

Academic year: 2022

Share "681 "NOTE STEPHAN BRANDT: On the structure of graphs with bounded clique number 693"

Copied!
1
0
0

加載中.... (立即查看全文)

全文

(1)

COMBINATORICA • Volume 23 • Number 4 • 2003

CONTENTS

ETSUKO BANNAI, KAZUKI KAWASAKI, YUSUKE NITAMIZU, TEPPEI SATO:

An upper bound for the cardinality of an s-distance set in Euclidean space 535

BELA BOLLOBAS, IMRE LEADER: Set systems with few disjoint pairs 559

JAMES D. CURRIE, CAMERON W. PIERCE: The fixing block method in combinatorics on words 571

ANDRAS GACS: On a generalization of Redei's theorem 585 W. GAO. Y. O. HAMIDOUNE, A. LLADO, O. SERRA: Covering a finite

abelian group by subset sums 599

MARTIN GROHE: Local tree-width, excluded minors, and approximation algorithms G13 HEIN VAN DER HOLST: TWO tree-width-like graph invariants 633 Louis KAUFFMAN, ROBIN THOMAS: Temperley-Lieb algebras and the four-

color theorem 653 HANNO LEFMANN: On heilbronn's problem in higher dimension 669

ZHI-WEI SUN: On the function w(x) — |{1 < s < k : x = as (mod ns)}\ .. 681

"NOTE

STEPHAN BRANDT: On the structure of graphs with bounded clique number 693

參考文獻

相關文件

• Use the binomial interest rate tree to model stochastic term structure.. – Illustrates the basic ideas underlying

We solve the three-in-a-tree problem on

– Taking any node in the tree as the current state induces a binomial interest rate tree and, again, a term structure.... Binomial Interest Rate

tree must be corrected in response to merging. It is ob- vious that the aected part of the tree structure after merging is just the sub-tree under the node of the region

We will present some applications of the the- ory, including the derivations of the wallcrossing formulas, higher rank Donaldson-Thomas invariants on local curves, and the

The tree of my title is not a green tree with leaves. It is the name of an abstract structure. In order to relate these abstract structures to the nature of the city , 1 must first

From the aforementioned discussion, we know that we can not tell the positive semidefiniteness of a symmetric matrix by its leading principal minors whereas we can do it for

Monopolies in synchronous distributed systems (Peleg 1998; Peleg