Results 1  10
of
1,982
Domain Theory
 Handbook of Logic in Computer Science
, 1994
"... Least fixpoints as meanings of recursive definitions. ..."
Abstract

Cited by 546 (25 self)
 Add to MetaCart
Least fixpoints as meanings of recursive definitions.
Splittings and Ramsey properties of permutation classes
 arXiv:1307.0027 [math.CO]. Cited on
"... We say that a permutation pi is merged from permutations ρ and τ, if we can color the elements of pi red and blue so that the red elements are orderisomorphic to ρ and the blue ones to τ. A permutation class is a set of permutations closed under taking subpermutations. A permutation class C is spli ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
systematically. As our main results, we show that if σ is a sumdecomposable permutation of order at least four, then the class Av(σ) of all σavoiding permutations is splittable, while if σ is a simple permutation, then Av(σ) is unsplittable. We also show that there is a close connection between splittings
Finite Presentation of Homogeneous Graphs, Posets and Ramsey Classes
, 2004
"... It is commonly believed that one can prove Ramsey properties only for simple and \well behaved" structures. This is supported by the link of Ramsey classes of structures with homogeneous structures. ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
It is commonly believed that one can prove Ramsey properties only for simple and \well behaved" structures. This is supported by the link of Ramsey classes of structures with homogeneous structures.
Ramsey Theory
, 2011
"... These are the notes based on the course on Ramsey Theory taught at Universität Hamburg in Summer 2011. The lecture was based on the textbook “Ramsey theory” of Graham, Rothschild, and Spencer [44]. In fact, large part of the material is taken from that book. ..."
Abstract
 Add to MetaCart
These are the notes based on the course on Ramsey Theory taught at Universität Hamburg in Summer 2011. The lecture was based on the textbook “Ramsey theory” of Graham, Rothschild, and Spencer [44]. In fact, large part of the material is taken from that book.
Forbidden Substructures and Combinatorial Dichotomies: WQO and Universality
, 2009
"... We discuss two combinatorial problems concerning classes of finite or countable structures of combinatorial type, constrained to omit a specified finite number of constraints given by forbidden substructures. These constitute decision problems, taking the finite set of constraints as input. While th ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We discuss two combinatorial problems concerning classes of finite or countable structures of combinatorial type, constrained to omit a specified finite number of constraints given by forbidden substructures. These constitute decision problems, taking the finite set of constraints as input. While
UNIVERSAL STRUCTURES AND THE LOGIC OF FORBIDDEN PATTERNS
, 2009
"... We show that forbidden patterns problems, when restricted to some classes of input structures, are in fact constraint satisfaction problems. This contrasts with the case of unrestricted input structures, for which it is known that there are forbidden patterns problems that are not constraint satisf ..."
Abstract
 Add to MetaCart
We show that forbidden patterns problems, when restricted to some classes of input structures, are in fact constraint satisfaction problems. This contrasts with the case of unrestricted input structures, for which it is known that there are forbidden patterns problems that are not constraint
Bowtiefree graphs have a Ramsey lift
, 2013
"... A bowtie is a graph consisting of two triangles with one vertex identified. We show that the class of all (countable) graphs not containing a bowtie as a subgraph have a Ramsey lift (expansion). This is the first nontrivial Ramsey class with a nontrivial algebraic closure ..."
Abstract
 Add to MetaCart
A bowtie is a graph consisting of two triangles with one vertex identified. We show that the class of all (countable) graphs not containing a bowtie as a subgraph have a Ramsey lift (expansion). This is the first nontrivial Ramsey class with a nontrivial algebraic closure
Bowtiefree graphs have a Ramsey lift
"... A bowtie is a graph consisting of two triangles with one vertex identified. We show that the class of all (countable) graphs not containing a bowtie as a subgraph have a Ramsey lift (expansion). This is the first nontrivial Ramsey class with a nontrivial algebraic closure. 1 ..."
Abstract
 Add to MetaCart
A bowtie is a graph consisting of two triangles with one vertex identified. We show that the class of all (countable) graphs not containing a bowtie as a subgraph have a Ramsey lift (expansion). This is the first nontrivial Ramsey class with a nontrivial algebraic closure. 1
Recognizing interval bigraphs by forbidden patterns
 CoRR
, 2012
"... Let H be a connected bipartite graph with n nodes and m edges. We give an O(nm) time algorithm to decide whether H is an interval bigraph. The best known algorithm has time complexity O(nm6(m + n) log n) and it was developed in 1997 [16]. Our approach is based on an ordering characterization of inte ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
of the pairdigraph. This way we make explicit what the difficult cases are and gain efficiency by isolating such situations. We believe our method can be used to find a desired ordering for other classes of graphs and digraphs having ordering characterization. 1
Universal graphs with a forbidden subtree
, 2006
"... 850 revision:20060524 modified:20060528 The systematic investigation of countable universal graphs with “forbidden” subgraphs was initiated in [13], followed by [12]. If C is a finite connected graph, then a graph G is Cfree if it contains no subgraph isomorphic to ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
850 revision:20060524 modified:20060528 The systematic investigation of countable universal graphs with “forbidden” subgraphs was initiated in [13], followed by [12]. If C is a finite connected graph, then a graph G is Cfree if it contains no subgraph isomorphic to
Results 1  10
of
1,982