1 citations · 6 across the 31 of their papers we have counts for
6 papers · 1 filter
Boundedness for proper conflict-free and odd colorings
Andrea Jiménez, Kolja Knauer, Carla Negri Lintzmayer +7
The proper conflict-free chromatic number, , of a graph is the least such that has a proper -coloring in which for each non-isolated vertex there is a co…
On -neighborly reorientations of oriented matroids
Rangel Hernández-Ortiz, Kolja Knauer, Luis Pedro Montejano
We study the existence and the number of -neighborly reorientations of an oriented matroid. This leads to -variants of McMullen's problem and Roudneff's conjecture, the case…
Roudneff's Conjecture in Dimension
Rangel Hernández-Ortiz, Kolja Knauer, Luis Pedro Montejano +1
J.-P. Roudneff conjectured in 1991 that every arrangement of pseudohyperplanes in the real projective space has at most $\sum_{i=0}^{d-2} \binom{n-…
Clustered independence and bounded treewidth
Kolja Knauer, Torsten Ueckerdt
A set of vertices of a graph is a -clustered set if it induces a subgraph with components of order at most each, and denotes the size of a larges…
Order and Gorenstein properties for lattice path matroid polytopes
Carolina Benedetti, Kolja Knauer, Jerónimo Valencia-Porras
We characterize matroids whose polytopes are order polytopes as a special class of lattice path matroids, called snakes. This shows that snakes are exactly the objects lying in the…
Concepts of Dimension for Convex Geometries
Kolja Knauer, William T. Trotter
Let be a finite set. A family of subsets of is called a convex geometry with ground set if (1) ; (2) whenever ; and (3)…