The following pages link to Dani Kotlar (Q322179):
Displaying 14 items.
- Decomposition of bi-colored square arrays into balanced diagonals (Q322180) (← links)
- On rainbow matchings in bipartite graphs (Q510529) (← links)
- On a conjecture of Stein (Q1688259) (← links)
- Fair representation in dimatroids (Q1689871) (← links)
- Two-line graphs of partial Latin rectangles (Q1792060) (← links)
- Refining invariants for computing autotopism groups of partial Latin rectangles (Q2305926) (← links)
- Uniqueness of the extreme cases in theorems of Drisko and Erdős-Ginzburg-Ziv (Q2408977) (← links)
- Fair representation in the intersection of two matroids (Q2409842) (← links)
- Topological methods for the existence of a rainbow matching (Q2413401) (← links)
- Decomposition of Bicolored Square Arrays into Bichromatic Diagonals (Q2957062) (← links)
- Degree Conditions for Matchability in 3‐Partite Hypergraphs (Q4604015) (← links)
- Fair Representation by Independent Sets (Q4604368) (← links)
- On Sequential Basis Exchange in Matroids (Q5163514) (← links)
- Representation of Large Matchings in Bipartite Graphs (Q5348494) (← links)
