Results 1  10
of
735
EEG alpha and theta oscillations reflect cognitive and memory performance: a review and analysis
, 1999
"... ..."
Graph minors. X. Obstructions to treedecomposition
 J. COMB. THEORY, SERIES B
, 1991
"... Roughly, a graph has small “treewidth” if it can be constructed by piecing small graphs together in a tree structure. Here we study the obstructions to the existence of such a tree structure. We find, for instance: (i) a minimax formula relating treewidth with the largest such obstructions (ii) an ..."
Abstract

Cited by 213 (10 self)
 Add to MetaCart
Roughly, a graph has small “treewidth” if it can be constructed by piecing small graphs together in a tree structure. Here we study the obstructions to the existence of such a tree structure. We find, for instance: (i) a minimax formula relating treewidth with the largest such obstructions (ii) an association between such obstructions and large grid minors of the graph (iii) a “treedecomposition” of the graph into pieces corresponding with the obstructions. These results will be of use in later papers.
Tree Matching Problems with Applications to Structured Text Databases
, 1992
"... Tree matching is concerned with finding the instances, or matches, of a given pattern tree in a given target tree. We introduce ten interrelated matching problems called tree inclusion problems. A specific tree inclusion problem is defined by specifying the trees that are instances of the patterns. ..."
Abstract

Cited by 83 (0 self)
 Add to MetaCart
Tree matching is concerned with finding the instances, or matches, of a given pattern tree in a given target tree. We introduce ten interrelated matching problems called tree inclusion problems. A specific tree inclusion problem is defined by specifying the trees that are instances of the patterns
Problems and results in combinatorial analysis
 COMBINATORICS (PROC. SYMP. PURE MATH
, 1971
"... This review of some solved and unsolved problems in combinatorial analysis will be highly subjective. i will only discuss problems which I either worked on or at least thought about. The disadvantages of such an approach are obvious, but the disadvantages are perhaps counterbalanced by the fact that ..."
Abstract

Cited by 56 (0 self)
 Add to MetaCart
the cardinal number of S; c, cl, c2,... will denote absolute constants not necessarily the same at each occurrence. I. I will start with some problems dealing with subsets of a set. Let IS I =n. A well known theorem of Sperner [57] states that if A i a S, 15 i 5 m, is such that no A, contains any other
On a problem of Moser
, 1969
"... Let f(n) be the largest integer with the following property: Every family F, of n sets contains a subfamily Fi of f(n) sets so that the union of two sets of Fi never equals a third*. Moser asked for the determination or estimation of f(n). A result of Kleitman [ 2] shows that f c n 1 c en/w. J. Ridd ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Let f(n) be the largest integer with the following property: Every family F, of n sets contains a subfamily Fi of f(n) sets so that the union of two sets of Fi never equals a third*. Moser asked for the determination or estimation of f(n). A result of Kleitman [ 2] shows that f c n 1 c en/w. J
Shifted set families, degree sequences, and plethysm
, 2008
"... We study, in three parts, degree sequences of kfamilies (or kuniform hypergraphs) and shifted kfamilies. • The first part collects for the first time in one place, various implications such as Threshold ⇒ Uniquely Realizable ⇒ DegreeMaximal ⇒ Shifted which are equivalent concepts for 2families ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
( = simple graphs), but strict implications for kfamilies with k ≥ 3. The implication that uniquely realizable implies degreemaximal seems to be new. • The second part recalls Merris and Roby’s reformulation of the characterization due to Ruch and Gutman for graphical degree sequences and shifted 2
MATCHINGS, CONNECTIVITY, AND EIGENVALUES IN REGULAR GRAPHS
, 2011
"... We study extremal and structural problems in regular graphs involving various parameters. In Chapter 2, we obtain the best lower bound for the matching number over nvertex connected regular graphs in terms of edgeconnectedness and determine when the matching number is minimized. We also establish ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study extremal and structural problems in regular graphs involving various parameters. In Chapter 2, we obtain the best lower bound for the matching number over nvertex connected regular graphs in terms of edgeconnectedness and determine when the matching number is minimized. We also establish
Frequency Assignment Problems
 HANDBOOK OF COMBINATORIAL OPTIMIZATION
, 1999
"... The ever growing number of wireless communications systems deployed around the globe have made the optimal assignment of a limited radio frequency spectrum a problem of primary importance. At issue are planning models for permanent spectrum allocation, licensing, regulation, and network design. Furt ..."
Abstract

Cited by 42 (3 self)
 Add to MetaCart
The ever growing number of wireless communications systems deployed around the globe have made the optimal assignment of a limited radio frequency spectrum a problem of primary importance. At issue are planning models for permanent spectrum allocation, licensing, regulation, and network design
Results 1  10
of
735