Michal Lason

Orcid: 0000-0003-4830-2270

According to our database1, Michal Lason authored at least 15 papers between 2010 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Modularity of minor-free graphs.
J. Graph Theory, April, 2023

2022
A Note on Seminormality of Cut Polytopes.
SIAM J. Discret. Math., 2022

2021
Optimal stopping for many connected components in a graph.
Random Struct. Algorithms, 2021

2017
Non-Normal Very Ample Polytopes - Constructions and Examples.
Exp. Math., 2017

The coloring game on matroids.
Discret. Math., 2017

On-line list coloring of matroids.
Discret. Appl. Math., 2017

2015
List coloring of matroids and base exchange properties.
Eur. J. Comb., 2015

2014
Triangle-free intersection graphs of line segments with large chromatic number.
J. Comb. Theory, Ser. B, 2014

An extremal problem on crossing vectors.
J. Comb. Theory, Ser. A, 2014

Coloring Intersection Graphs of Arc-Connected Sets in the Plane.
Discret. Comput. Geom., 2014

Indicated coloring of matroids.
Discret. Appl. Math., 2014

2013
Triangle-Free Geometric Intersection Graphs with Large Chromatic Number.
Discret. Comput. Geom., 2013

f-Vectors Implying Vertex Decomposability.
Discret. Comput. Geom., 2013

Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

2010
A Generalization of Combinatorial Nullstellensatz.
Electron. J. Comb., 2010


  Loading...