Cutting a graph into two dissimilar halves

DOI10.1002/jgt.3190120113zbMath0655.05059OpenAlexW1969292476WikidataQ105889473 ScholiaQ105889473MaRDI QIDQ3801597

János Pach, Mark K. Goldberg, Paul Erdős, J. H. Spencer

Publication date: 1988

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190120113

zbMATH Keywords

discrepancynumbers of the edges

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items

Intersections of graphs, On the sum of the \(L_1\) influences of bounded functions, Discrepancy of random graphs and hypergraphs, How unproportional must a graph be?, Hereditary quasirandomness without regularity, Turán's theorem for pseudo-random graphs, On the discrepancies of graphs, Combinatorics. Abstracts from the workshop held January 1--7, 2023, A Sequence of Triangle-Free Pseudorandom Graphs, Extremal results in sparse pseudorandom graphs, Intersections of random hypergraphs and tournaments, Intersections of hypergraphs, The maximum edit distance from hereditary graph properties, Sizes of Induced Subgraphs of Ramsey Graphs, Linear dependence between hereditary quasirandomness conditions, Induced Ramsey-type theorems, Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions, Induced subgraphs with distinct sizes, Proof of a conjecture on induced subgraphs of Ramsey graphs

Cites Work

• A note on the probabilistic approach to Turan's problem
• Unnamed Item