Discrepancy in graphs and hypergraphs

MaRDI QIDQ5477810zbMATH OpenFDO

Authors Béla Bollobás, Alex Scott

Publication date 29 June 2006

zbMATH Keywords

random partitions

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Recommendations

• Discrepancy of random graphs and hypergraphs
• The smallest n-uniform hypergraph with positive discrepancy
• On small \(n\)-uniform hypergraphs with positive discrepancy
• Cutting a graph into two dissimilar halves
• scientific article; zbMATH DE number 881162

Cited in

(17)

• The smallest n-uniform hypergraph with positive discrepancy
• How unproportional must a graph be?
• On small \(n\)-uniform hypergraphs with positive discrepancy
• Discrepancy of symmetric products of hypergraphs
• Discrepancy properties for random regular digraphs
• Discrepancy of random graphs and hypergraphs
• Discrepancy of products of hypergraphs
• Discrepancy inequalities for directed graphs
• Intersections of random hypergraphs and tournaments
• Intersections of hypergraphs
• scientific article; zbMATH DE number 881162 (Why is no real title available?)
• Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
• Combinatorics. Abstracts from the workshop held January 1--7, 2023
• Normalized Laplacian eigenvalues of hypergraphs
• Discrepancy and sparsity
• Bisection width, discrepancy, and eigenvalues of hypergraphs
• Turán problems in pseudorandom graphs

This page was built for publication: Discrepancy in graphs and hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5477810)