Sciweavers

600 search results - page 1 / 120
» Problems and results in extremal combinatorics - II
Sort
View
CPM
2008
Springer
170views Combinatorics» more  CPM 2008»
15 years 4 days ago
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
Nadja Betzler, Michael R. Fellows, Christian Komus...
CPM
2004
Springer
97views Combinatorics» more  CPM 2004»
15 years 3 months ago
New Results for the 2-Interval Pattern Problem
Guillaume Blin, Guillaume Fertin, Stéphane ...
COMBINATORICS
2007
64views more  COMBINATORICS 2007»
14 years 10 months ago
Extremal Subsets of {1, ..., n} Avoiding Solutions to Linear Equations in Three Variables
We refine previous results to provide examples, and in some cases precise classifications, of extremal subsets of {1, ..., n} containing no solutions to a wide class of non-inva...
Peter Hegarty
BSL
2000
153views more  BSL 2000»
14 years 10 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
Jan Krajícek, Thomas Scanlon
COMBINATORICS
2000
128views more  COMBINATORICS 2000»
14 years 10 months ago
Continued Fractions and Catalan Problems
We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to...
Mahendra Jani, Robert G. Rieper