24 citations · 94 across the 38 of their papers we have counts for
4 papers · 2 filters
A Tutte polynomial inequality for lattice path matroids
Kolja Knauer, Leonardo Martínez-Sandoval, Jorge Luis Ramírez Alfonsín
Let be a matroid without loops or coloops and let be its Tutte polynomial. In 1999 Merino and Welsh conjectured that holds…
Drawing graphs with vertices and edges in convex position
Ignacio García-Marco, Kolja Knauer
A graph has strong convex dimension , if it admits a straight-line drawing in the plane such that its vertices are in convex position and the midpoints of its edges are also in…
COMs: Complexes of Oriented Matroids
Hans-Juergen Bandelt, Victor Chepoi, Kolja Knauer
In his seminal 1983 paper, Jim Lawrence introduced lopsided sets and featured them as asymmetric counterparts of oriented matroids, both sharing the key property of strong eliminat…
Planar digraphs without large acyclic sets
Kolja Knauer, Petru Valicov, Paul S. Wenger
Given a directed graph, an acyclic set is a set of vertices inducing a subgraph with no directed cycle. In this note we show that there exist oriented planar graphs of order fo…