547 search results - page 106 / 110 » dm 2008 |
97
Voted
DM
2008
15 years 24 days ago
2008
For two graphs G and H, let the mixed anti-Ramsey numbers, maxR(n; G, H), (minR(n; G, H)) be the maximum (minimum) number of colors used in an edge-coloring of a complete graph wi...
94
Voted
DM
2008
15 years 24 days ago
2008
Many interesting combinatorial objects are enumerated by the k-Catalan numbers, one possible generalization of the Catalan numbers. We will present a new combinatorial object that...
129
Voted
DM
2000
15 years 16 days ago
2000
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
124
click to vote
DM
1998
15 years 12 days ago
1998
We give a counterexample to a conjecture by Wild about binary matroids. We connect two equivalent lines of research in matroid theory: a simple type of basis-exchange property and ...
105
Voted
WOB
2007
15 years 1 months ago
2007
Abstract. Gene Set Enrichment Analysis (GSEA) is a well-known technique used for studying groups of functionally related genes and their correlation with phenotype. This method cre...