The following pages link to Jakub Kozik (Q322291):
Displayed 29 items.
- Extremal problems for colorings of simple hypergraphs and applications (Q322292) (← links)
- Triangle-free geometric intersection graphs with large chromatic number (Q377499) (← links)
- Triangle-free intersection graphs of line segments with large chromatic number (Q401487) (← links)
- In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid (Q408542) (← links)
- Pathwidth and nonrepetitive list coloring (Q504976) (← links)
- Nonrepetitive colouring via entropy compression (Q524188) (← links)
- Nonrepetitive sequences on arithmetic progressions (Q648401) (← links)
- Chip games and paintability (Q726662) (← links)
- Improved algorithms for colorings of simple hypergraphs and applications (Q896005) (← links)
- Deferred on-line bipartite matching (Q1753111) (← links)
- Random hypergraphs and property B (Q2225409) (← links)
- Towards an on-line version of Ohba's conjecture (Q2441619) (← links)
- (Q2851695) (← links)
- Lower Bounds for On-line Graph Colorings (Q2942655) (← links)
- (Q2959882) (← links)
- (Q2959884) (← links)
- (Q2959924) (← links)
- A note on random greedy coloring of uniform hypergraphs (Q3452724) (← links)
- Multipass greedy coloring of simple uniform hypergraphs (Q3467582) (← links)
- Intuitionistic vs. Classical Tautologies, Quantitative Comparison (Q3499752) (← links)
- (Q3576000) (← links)
- Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System (Q3605535) (← links)
- New approach to nonrepetitive sequences (Q4909201) (← links)
- Asymptotically almost all \lambda-terms are strongly normalizing (Q4913764) (← links)
- A note on two-colorability of nonuniform hypergraphs (Q5002721) (← links)
- Nonrepetitive Choice Number of Trees (Q5300504) (← links)
- Dimension is polynomial in height for posets with planar cover graphs (Q6187346) (← links)
- Schnyder woods and Alon-Tarsi number of planar graphs (Q6194260) (← links)
- Improving Gebauer's construction of 3-chromatic hypergraphs with few edges (Q6361354) (← links)