The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Lower Bounds for Maximum Weighted Cut
Open accessAbstract
Abstract. While there have been many results on lower bounds for Max Cut in unweighted graphs, the only lower bound for noninteger weights is that by Poljak and Turzík [ Discrete Math., 58 (1986), pp. 99–104]. In this paper, we launch an extensive study of lower bounds for Max Cut in weighted graphs. We introduce a new approach for obtaining lower bounds for Weighted Max Cut. Using it, the probabilistic method, Vizing’s chromatic index theorem, and other tools, we obtain several lower bounds for arbitrary weighted graphs, weighted graphs of bounded girth, and triangle-free weighted graphs. We pose conjectures and open questions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The WMaxcut is both NP-Hard 24 and APX-Hard 25 problems.”
From Toward a linear-ramp QAOA protocol: evidence of a scaling advantage in solving some combinatorial optimization problems (2025) · cites this paper as [24]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Grossman, P. (2009) · doi:10.1007/978-0-230-37405-8_1 · Cited by 9,160
Alon, N., & Spencer, J. (2000) · Wiley eBooks · doi:10.1002/0471722154 · Cited by 951
Itai, A., Papadimitriou, C. H., & SZWARCFITER, J. L. (1982) · SIAM Journal on Computing · doi:10.1137/0211056 · Cited by 518
Node-and edge-deletion NP-complete problems
Yannakakis, M. (1978) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800133.804355 · Cited by 445
On the number of pentagons in triangle-free graphs
Hatami, H., Hladký, J., Král͏̌, D., et al. (2013) · Journal of Combinatorial Theory Series A · doi:10.1016/j.jcta.2012.12.008 · Cited by 166
On the maximum number of five-cycles in a triangle-free graph
Grzesik, A. (2012) · Journal of Combinatorial Theory Series B · doi:10.1016/j.jctb.2012.04.001 · Cited by 120
Alon, N. (1996) · COMBINATORICA · doi:10.1007/bf01261315 · Cited by 83
Largest bipartite subgraphs in triangle‐free graphs with maximum degree three
Bondy, J. A., & Locke, S. C. (1986) · Journal of Graph Theory · doi:10.1002/jgt.3190100407 · Cited by 81
A note on bipartite subgraphs of triangle‐free graphs
Shearer, J. B. (1992) · Random Structures and Algorithms · doi:10.1002/rsa.3240030211 · Cited by 62
Approximation and intractability results for the maximum cut problem and its variants
Haglin, D. J., & Venkatesan, S. M. (1991) · IEEE Transactions on Computers · doi:10.1109/12.67327 · Cited by 59
Research works printed but not linked: 3
- Bollobás B., 2002, Contemporary Combinatorics, 185
- P. Erdös , On some problems in graph theory, combinatorial analysis and combinatorial number theory, in Graph Theory and Combinatorics (Cambridge, 1983), Academic Press, London, 1984, pp. 1–17.
- Karp R. M., 2013, Complexity of Computer Computations (Yorktown Heights, NY, 1972), 85
Cited by
Sorted by citations
Montañez-Barrera, J. A., & Michielsen, K. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01082-1 · Cited by 34
Metadata
- Authors
- Gutin, G., & Yeo, A.
- Affiliations
- Royal Holloway University of London (GB)
- University of Southern Denmark (DK)
- Venue
- SIAM Journal on Discrete Mathematics
- Published
- 2023-06-16
- Volume
- 37
- Issue
- 2
- Pages
- 1142-1161
- ISSN
- 0895-4801 (ISSN-L)
- 1095-7146
- OpenAlex
- W4380886424
- Cited by
- 7
- References
- 16
- Citations by year
- 2026: 2 · 2025: 3 · 2024: 1
- FWCI
- 0.86
- Type
- journal article
- Language
- en
- Open access
- Locations
- SIAM Journal on Discrete Mathematics (publishedVersion)
- University of Southern Denmark Research Portal (University of Southern Denmark) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Limits and Structures in Graph Theory
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Graph Theory Research
- Keywords
- lower bounds, MaxCut, weighted graphs, triangle-free graphs, probabilistic methods, hardness of approximation
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
