The following pages link to Jonad Pulaj (Q311521):
Displayed 8 items.
- New conjectures for union-closed families (Q311524) (← links)
- On the linear ordering problem and the rankability of data (Q2072628) (← links)
- Cutting planes for families implying Frankl’s conjecture (Q5207443) (← links)
- A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture (Q5883707) (← links)
- Characterizing 3-Sets in Union-Closed Families (Q6112173) (← links)
- Automating weight function generation in graph pebbling (Q6202944) (← links)
- A Safe Computational Framework for Integer Programming applied to Chv\'atal's Conjecture (Q6306293) (← links)
- Local Configurations in Union-Closed Families (Q6422476) (← links)