
Explore edge connectivity in simple graphs using cut queries, introducing star contraction for efficient graph simplification and discussing randomized and quantum algorithms for connectivity determination.

Explore linear sketching techniques for hypergraph sparsification, examining upper and lower bounds, dynamic streaming algorithms, and novel methods like random fingerprinting for efficient cut preservation.

Explore cut sparsification of hypergraphs, focusing on submodular functions. Learn about new bounds, polynomial bounds, and succinct representation techniques for various submodular function families.

Explore the structure of dense triangle-free graphs and learn about efficient algorithms for computing their approximate representations using smaller graphs.