The following pages link to (Q3859790):
Displayed 8 items.
- Some new bounds on partition critical hypergraphs (Q412276) (← links)
- Best-case and worst-case sparsifiability of Boolean CSPs (Q786033) (← links)
- On constructive methods in the theory of colour-critical graphs (Q1121899) (← links)
- Lifting theorems and facet characterization for a class of clique partitioning inequalities (Q1306454) (← links)
- Sparsification upper and lower bounds for graph problems and not-all-equal SAT (Q2408194) (← links)
- Partition Critical Hypergraphs (Q2851519) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- (Q5009477) (← links)