Sciweavers

101 search results - page 4 / 21
» On completely nonmeasurable unions
Sort
View
ENDM
2007
104views more  ENDM 2007»
13 years 7 months ago
Matching graphs of Hypercubes and Complete Bipartite Graphs
Kreweras’ conjecture [9] asserts that every perfect matching of the hypercube Qd can be extended to a Hamiltonian cycle of Qd. We [5] proved this conjecture but here we present ...
Jirí Fink
JSYML
2008
66views more  JSYML 2008»
13 years 7 months ago
Special groups whose isometry relation is a finite union of cosets
0-stable 0-categorical linked quaternionic mappings are studied and are shown to correspond (in some sense) to special groups which are 0stable, 0-categorical, satisfy AP(3) and ha...
Vincent Astier
JCT
2010
135views more  JCT 2010»
13 years 6 months ago
Countable connected-homogeneous graphs
Abstract. A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the cou...
Robert Gray, D. Macpherson
VLDB
2003
ACM
141views Database» more  VLDB 2003»
14 years 7 months ago
Computing complete answers to queries in the presence of limited access patterns
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...
Chen Li
DBPL
2007
Springer
91views Database» more  DBPL 2007»
14 years 1 months ago
Relational Completeness of Query Languages for Annotated Databases
Annotated relational databases can be queried either by simply making the annotations explicitly available along the ordinary data, or by adapting the standard query operators so ...
Floris Geerts, Jan Van den Bussche