67 citations · 256 across the 18 of their papers we have counts for
6 papers · 1 filter
Coloring intersection graphs of arc-connected sets in the plane
Michał Lasoń, Piotr Micek, Arkadiusz Pawlik +1
A family of sets in the plane is simple if the intersection of its any subfamily is arc-connected, and it is pierced by a line if the intersection of its any member with is…
A generalization of Combinatorial Nullstellensatz
Michał Lasoń
In this note we give an extended version of Combinatorial Nullstellensatz, with weaker assumption on nonvanishing monomial. We also present an application of our result in a situat…
f-vectors implying vertex decomposability
Michał Lasoń
We prove that if a pure simplicial complex of dimension d with n facets has the least possible number of (d-1)-dimensional faces among all complexes with n faces of dimension d, th…
Indicated coloring of matroids
Michał Lasoń
A coloring of a matroid is proper if elements of the same color form an independent set. For a loopless matroid M, its chromatic number χ(M) is the minimum number of colors that su…
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles
Andrei Asinowski, Jean Cardinal, Nathann Cohen +9
We consider a coloring problem on dynamic, one-dimensional point sets: points appearing and disappearing on a line at given times. We wish to color them with k colors so that at an…
On-line list coloring of matroids
Michał Lasoń, Wojciech Lubawski
A coloring of a matroid is proper if elements of the same color form an independent set. A theorem of Seymour asserts that a k-colorable matroid is also colorable from any lists of…