𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity results for rainbow matchings

✍ Scribed by Le, Van Bang; Pfender, Florian

Book ID
122131171
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
211 KB
Volume
524
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Constrained Ramsey numbers for rainbow m
Constrained Ramsey numbers for rainbow matching
✍ Allan Siu Lun Lo πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 77 KB

The Ramsey number R k (G) of a graph G is the minimum number N, such that any edge coloring of K N with k colors contains a monochromatic copy of G. The constrained Ramsey number f (G, T ) of the graphs G and T is the minimum number N, such that any edge coloring of K N with any number of colors con

Complexity results for triangular sets
Complexity results for triangular sets
✍ Γ‰ric Schost πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 510 KB

We study the representation of the solutions of a polynomial system by triangular sets, and concentrate on the positive-dimensional case. We reduce to dimension zero by placing the free variables in the base field, so the solutions can be represented by triangular sets with coefficients in a rationa

Complexity results for well-covered grap
Complexity results for well-covered graphs
✍ Ramesh S. Sankaranarayana; Lorna K. Stewart πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 740 KB

## Abstract A graph with __n__ vertices is well covered if every maximal independent set is a maximum independent set and very well covered if every maximal independent set has size __n__/2. In this work, we study these graphs from an algorithmic complexity point of view. We show that well‐covered