The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Paths, Trees, and Flowers
Open accessAbstract
A graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertices, called the end-points of the edge. An edge is said to join its end-points. A matching in G is a subset of its edges such that no two meet the same vertex. We describe an efficient algorithm for finding in a given graph a matching of maximum cardinality. This problem was posed and partly solved by C. Berge; see Sections 3.7 and 3.8.
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.
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
The Factorization of Linear Graphs
Tutte, W. T. (1947) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-22.2.107 · Cited by 945
The Theory of Graphs and its Applications.
Harary, F., & Berge, C. (1963) · Biometrika · doi:10.2307/2333777 · Cited by 603
Berge, C. (1957) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.43.9.842 · Cited by 577
Some recent applications of the theory of linear inequalities to extremal combinatorial analysis
Hoffman, A. J. (1960) · Proceedings of symposia in applied mathematics · doi:10.1090/psapm/010/0114759 · Cited by 192
An algorithm for a minimum cover of a graph
Norman, R. Z., & Rabin, M. O. (1959) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1959-0106853-5 · Cited by 115
Covers and packings in a family of sets
Edmonds, J. (1962) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1962-10791-5 · Cited by 101
Self-citation
Research works printed but not linked: 3
- Ford, 1962, Flows in networks
- Witzgall, 1965, Modification of Edmonds﹜ algorithm for maximum matching of graphs, 69B
- Edmonds, 1965, J. Res. Natl. Bureau Standards, 69B
Cited by
Sorted by citations
Items 201–300 of 1,001
Algorithms for finding K-best perfect matchings
Chegireddy, C. R., & Hamacher, H. W. (1987) · Discrete Applied Mathematics · doi:10.1016/0166-218x(87)90017-5 · Cited by 89
Characterization of Waiting Times in a Simulation of Kidney Paired Donation
Segev, D. L., Gentry, S. E., Melancon, J. K., & Montgomery, R. A. (2005) · American Journal of Transplantation · doi:10.1111/j.1600-6143.2005.01048.x · Cited by 89
NISQ+: Boosting quantum computing power by approximating quantum error correction
Holmes, A. A., Jokar, M. R., Pasandi, G., Ding, Y., Pedram, M., & Chong, F. T. (2020) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca45697.2020.00053 · Cited by 88
Distribution of entanglement in large-scale quantum networks
Perseguers, S., Lapeyre, G. J., Cavalcanti, D., Lewenstein, M., & Acín, A. (2013) · Reports on Progress in Physics · doi:10.1088/0034-4885/76/9/096001 · Cited by 106
Solving matching problems with linear programming
Grötschel, M., & Holland, O. E. (1985) · Mathematical Programming · doi:10.1007/bf01584376 · Cited by 88
Optimal Perfectly Secure Message Transmission
Srinathan, K., Narayanan, A., & Rangan, C. P. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28628-8_33 · Cited by 87
Exact algorithms for dominating set
van Rooij, J. M. M., & Bodlaender, H. L. (2011) · Discrete Applied Mathematics · doi:10.1016/j.dam.2011.07.001 · Cited by 87
Simulating the performance of a distance-3 surface code in a linear ion trap
Trout, C. J., Li, M., Gutiérrez, M., Wu, Y., Wang, S.-T., Duan, L., & Brown, K. R. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aab341 · Cited by 89
Blueprint for a High-Performance Fluxonium Quantum Processor
Nguyen, L. B., Koolstra, G., Kim, Y., Morvan, A., Chistolini, T., Singh, S., Nesterov, K., Jünger, C., Chen, L., Pedramrazi, Z., et al. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.037001 · Cited by 96
J�nger, M., & Thienel, S. (2000) · Software Practice and Experience · doi:10.1002/1097-024x(200009)30:11 · Cited by 86
Role of microRNAs as Clinical Cancer Biomarkers for Ovarian Cancer: A Short Overview
Staicu, C. E., Predescu, D. V., Rusu, C. M., Radu, B. M., Crețoiu, D., Suciu, N., Creţoiu, S. M., & Voinea, S.-C. (2020) · Cells · doi:10.3390/cells9010169 · Cited by 85
An algorithmic proof of Tutte's f-factor theorem
Anstee, R. P. (1985) · Journal of Algorithms · doi:10.1016/0196-6774(85)90022-7 · Cited by 85
Fast decoders for qudit topological codes
Anwar, H., Brown, B. J., Campbell, E. T., & Browne, D. E. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/6/063038 · Cited by 85
A theory of school-choice lotteries
Kesten, O., & Ünver, M. U. (2015) · Theoretical Economics · doi:10.3982/te1558 · Cited by 85
Some facets of the simple plant location polytope
Cornuéjols, G., & Thizy, J. (1982) · Mathematical Programming · doi:10.1007/bf01583779 · Cited by 85
Improved Decoding of Circuit Noise and Fragile Boundaries of Tailored Surface Codes
Higgott, O., Bohdanowicz, T. C., Kubica, A., Flammia, S. T., & Campbell, E. T. (2023) · Physical Review X · doi:10.1103/physrevx.13.031007 · Cited by 126
K best solutions to combinatorial optimization problems
Hamacher, H. W., & Queyranne, M. (1985) · Annals of Operations Research · doi:10.1007/bf02022039 · Cited by 84
Recent advances on Dirac-type problems for hypergraphs
Zhao, Y. (2016) · The IMA volumes in mathematics and its applications · doi:10.1007/978-3-319-24298-9_6 · Cited by 83
Duchet, P. (1984) · North-Holland mathematics studies · doi:10.1016/s0304-0208(08)72924-4 · Cited by 83
Systematic Review of Clustering High-Dimensional and Large Datasets
Pandove, D., Goel, S., & Rani, R. (2018) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3132088 · Cited by 81
Matching as a non-cooperative game
Albarelli, A., Bulò, S. R., Andrea Torsello, A., & Pelillo, M. (2009) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2009.5459312 · Cited by 82
Solving combinatorial optimization problems using Karmarkar's algorithm
Mitchell, J. E., & Todd, M. J. (1992) · Mathematical Programming · doi:10.1007/bf01580902 · Cited by 82
Leeuwen, J. V. (1990) · Elsevier eBooks · doi:10.1016/b978-0-444-88071-0.50015-1 · Cited by 82
Classifying the computational complexity of problems
Stockmeyer, L. J. (1987) · Journal of Symbolic Logic · doi:10.2307/2273858 · Cited by 82
Universal Quantum Computing with Twist-Free and Temporally Encoded Lattice Surgery
Chamberland, C., & Campbell, E. T. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010331 · Cited by 101
Low-temperature properties of the ±J Ising spin glass in two dimensions
Wang, J., & Swendsen, R. H. (1988) · Physical review. B, Condensed matter · doi:10.1103/physrevb.38.4840 · Cited by 80
Parallelized quantum error correction with fracton topological codes
Brown, B. J., & Williamson, D. J. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.013303 · Cited by 79
Low-Overhead Fault-Tolerant Quantum Error Correction with the Surface-GKP Code
Noh, K., Chamberland, C., & Brandão, F. G. S. L. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010315 · Cited by 99
Cornuéjols, G., Hartvigsen, D., & Pulleyblank, W. R. (1982) · Operations Research Letters · doi:10.1016/0167-6377(82)90016-5 · Cited by 79
Routing helicopters for crew exchanges on off-shore locations
Sierksma, G., & Tijssen, G. A. (1998) · Annals of Operations Research · doi:10.1023/a:1018900705946 · Cited by 78
MAXIMUM WEIGHT CYCLE PACKING IN DIRECTED GRAPHS, WITH APPLICATION TO KIDNEY EXCHANGE PROGRAMS
Bíró, P., Manlove, D. F., & Rizzi, R. (2009) · Discrete Mathematics Algorithms and Applications · doi:10.1142/s1793830909000373 · Cited by 78
A Survey of Reconfigurable Optical Networks
Hall, M. N., Foerster, K.-T., Schmid, S., & Durairajan, R. (2021) · Optical Switching and Networking · doi:10.1016/j.osn.2021.100621 · Cited by 77
Efficient Markov chain Monte Carlo algorithm for the surface code
Hutter, A., Wootton, J. R., & Loss, D. (2014) · Physical Review A · doi:10.1103/physreva.89.022326 · Cited by 77
Three-dimensional surface codes: Transversal gates and fault-tolerant architectures
Vasmer, M., & Browne, D. E. (2019) · Physical Review A · doi:10.1103/physreva.100.012312 · Cited by 76
Chamberland, C., & Noh, K. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00319-5 · Cited by 97
Path planning for cooperative routing of air-ground vehicles
Manyam, S. G., Casbeer, D. W., & Sundar, K. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7526082 · Cited by 76
Moscato, P. (1993) · Annals of Operations Research · doi:10.1007/bf02022564 · Cited by 76
Overwater, R. W. J., Babaie, M., & Sebastiano, F. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3174017 · Cited by 76
Global constraints for round robin tournament scheduling
Henz, M., Müller, T., & Thiel, S. (2003) · European Journal of Operational Research · doi:10.1016/s0377-2217(03)00101-2 · Cited by 75
Algebraic Algorithms for Matching and Matroid Problems
Harvey, N. J. A. (2009) · SIAM Journal on Computing · doi:10.1137/070684008 · Cited by 68
FPT algorithms for path-transversal and cycle-transversal problems
Guillemot, S. (2010) · Discrete Optimization · doi:10.1016/j.disopt.2010.05.003 · Cited by 73
The even‐path problem for graphs and digraphs
LaPaugh, A. S., & Papadimitriou, C. H. (1984) · Networks · doi:10.1002/net.3230140403 · Cited by 73
Hell, P., Kirkpatrick, D., Kratochvı́l, J., & Kříž, I. (1988) · SIAM Journal on Discrete Mathematics · doi:10.1137/0401046 · Cited by 73
Pareto optimality in coalition formation
Aziz, H., Brandt, F., & Harrenstein, P. (2013) · Games and Economic Behavior · doi:10.1016/j.geb.2013.08.006 · Cited by 72
Efficient Algorithms for Petersen's Matching Theorem
Biedl, T., Bose, P. K., Demaine, E. D., & Lubiw, A. (2001) · Journal of Algorithms · doi:10.1006/jagm.2000.1132 · Cited by 72
Bazzaz, H. H., Tewari, M., Wang, G., Porter, G., Ng, T. S. E., Andersen, D. G., Kaminsky, M., Kozuch, M. A., & Vahdat, A. M. (2011) · ACM Symposium on Cloud Computing (SoCC) · doi:10.1145/2038916.2038946 · Cited by 72
Pulleyblank, W. R. (1996) · The MIT Press eBooks · Cited by 71
An extension of matching theory
Cornuéjols, G., & Hartvigsen, D. (1986) · Journal of Combinatorial Theory Series B · doi:10.1016/0095-8956(86)90085-7 · Cited by 72
Pulleyblank, W. R. (1983) · Springer eBooks · doi:10.1007/978-3-642-68874-4_13 · Cited by 72
A new approach to maximum matching in general graphs
Blüm, N. (2005) · Springer eBooks · doi:10.1007/bfb0032060 · Cited by 71
Scaling hypothesis for the Euclidean bipartite matching problem
Sergio Caracciolo, A., Lucibello, C., Giorgio Parisi, A., & Sicuro, G. (2014) · Physical Review E · doi:10.1103/physreve.90.012118 · Cited by 71
Min-Max Results in Combinatorial Optimization
Schrijver, A. (1983) · Springer eBooks · doi:10.1007/978-3-642-68874-4_18 · Cited by 71
A shortest augmenting path method for solving minimal perfect matching problems
Derigs, U. (1981) · Networks · doi:10.1002/net.3230110407 · Cited by 71
Blum, L., & Blum, M. (2022) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2115934119 · Cited by 70
A 2-approximation algorithm for the minimum weight edge dominating set problem
Fujito, T., & Nagamochi, H. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(00)00383-8 · Cited by 70
The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game
Vazirani, V. V. (2012) · Journal of the ACM · doi:10.1145/2160158.2160160 · Cited by 69
Neural network decoder for topological color codes with circuit level noise
Baireuther, P., Caio, M. D., Criger, B., Beenakker, C. W. J., & O’Brien, T. E. (2019) · New Journal of Physics · doi:10.1088/1367-2630/aaf29e · Cited by 84
Optimal a priori balance in the design of controlled experiments
Kallus, N. (2013) · Journal of the Royal Statistical Society Series B (Statistical Methodology) · doi:10.1111/rssb.12240 · Cited by 105
Periodic multiprocessor scheduling
Korst, J., Aarts, E., Lenstra, J. K., & Wessels, J. J. (1991) · Lecture notes in computer science · doi:10.1007/bfb0035103 · Cited by 69
Quality and efficiency for kernel density estimates in large data
Zheng, Y. L., Jestes, J., Phillips, J. M., & Li, F. (2013) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2463676.2465319 · Cited by 69
Fault-Tolerant Quantum Computation with Static Linear Optics
Tzitrin, I., Matsuura, T., Alexander, R. N., Dauphinais, G., Bourassa, J. E., Sabapathy, K. K., Menicucci, N. C., & Dhand, I. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040353 · Cited by 75
An augmenting path algorithm for linear matroid parity
Gabow, H. N., & Stallmann, M. F. M. (1986) · COMBINATORICA · doi:10.1007/bf02579169 · Cited by 67
Editing graphs to satisfy degree constraints: A parameterized approach
Mathieson, L., & Szeider, S. (2011) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2011.02.001 · Cited by 67
Song, J., Yuan, Z., Tan, H., Huber, T., & Burrage, K. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm505 · Cited by 67
Packings by cliques and by finite families of graphs
Hell, P., & Kirkpatrick, D. G. (1984) · Discrete Mathematics · doi:10.1016/0012-365x(84)90150-x · Cited by 67
Combinatorial and computational aspects of graph packing and graph decomposition
Yuster, R. (2007) · Computer Science Review · doi:10.1016/j.cosrev.2007.07.002 · Cited by 65
Image segmentation with minimum mean cut
Wang, S., & Siskind, J. M. (2002) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2001.937560 · Cited by 66
Sönmez, T., & Yenmez, M. B. (2021) · RePEc: Research Papers in Economics · doi:10.48550/arxiv.2102.03186 · Cited by 66
Reconfiguring Independent Sets in Claw-Free Graphs
Bonsma, P., Kamiński, M., & Wrochna, M. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-08404-6_8 · Cited by 65
Generalized subgraph-restricted matchings in graphs
Goddard, W. D., Hedetniemi, S. M., Hedetniemi, S. T., & Laskar, R. C. (2005) · Discrete Mathematics · doi:10.1016/j.disc.2004.08.027 · Cited by 65
Billionnet, A., & Minoux, M. (1985) · Discrete Applied Mathematics · doi:10.1016/0166-218x(85)90035-6 · Cited by 65
Applications of Set Covering, Set Packing and Set Partitioning Models: A Survey
Vemuganti, R. R. (1998) · Springer eBooks · doi:10.1007/978-1-4613-0303-9_9 · Cited by 65
Relaxed tours and path ejections for the traveling salesman problem
Rego, C. (1998) · European Journal of Operational Research · doi:10.1016/s0377-2217(97)00288-9 · Cited by 65
Rao, A., & Yehudayoff, A. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108671644 · Cited by 64
Adaptive paired comparison design
Glickman, M. E., & Jensen, S. T. (2003) · Journal of Statistical Planning and Inference · doi:10.1016/j.jspi.2003.09.022 · Cited by 64
The stable set polytope of quasi-line graphs
Eisenbrand, F., Oriolo, G., Stauffer, G., & Ventura, P. (2008) · COMBINATORICA · doi:10.1007/s00493-008-2244-x · Cited by 64
Greedoids - A Structural Framework for the Greedy Algorithm
Körte, B., & Lovász, L. (1984) · Elsevier eBooks · doi:10.1016/b978-0-12-566780-7.50019-2 · Cited by 64
Redundancy and Linear Programs
Macdonald, P., & Telgen, J. (1982) · Journal of the Operational Research Society · doi:10.2307/2581738 · Cited by 63
Single-Shot Error Correction of Three-Dimensional Homological Product Codes
Quintavalle, A. O., Vasmer, M., Roffe, J., & Campbell, E. T. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020340 · Cited by 62
Approximating Maximum Weight Matching in Near-Linear Time
Duan, R., & Pettie, S. (2010) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.70 · Cited by 62
Zenklusen, R., Ries, B., Picouleau, C., de Werra, D., Costa, M.-C., & Bentz, C. (2009) · Discrete Mathematics · doi:10.1016/j.disc.2009.01.006 · Cited by 62
Coherence in logical quantum channels
Iverson, J. K., & Preskill, J. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab8e5c · Cited by 61
A kernel of order for vertex cover
Lampis, M. (2011) · Information Processing Letters · doi:10.1016/j.ipl.2011.09.003 · Cited by 61
Self-correcting quantum memory in a thermal environment
Chesi, S., Röthlisberger, B., & Loss, D. (2010) · Physical Review A · doi:10.1103/physreva.82.022305 · Cited by 73
Trotter, L. E. (1977) · Mathematical Programming · doi:10.1007/bf01593791 · Cited by 61
Analysing correlated noise on the surface code using adaptive decoding algorithms
Nickerson, N., & Brown, B. J. (2019) · Quantum · doi:10.22331/q-2019-04-08-131 · Cited by 66
Computing equilibria: a computational complexity perspective
Roughgarden, T. (2009) · Economic Theory · doi:10.1007/s00199-009-0448-y · Cited by 60
Fowler, A. G., Whiteside, A. C., McInnes, A. L., & Rabbani, A. (2012) · Physical Review X · doi:10.1103/physrevx.2.041003 · Cited by 61
Generating hierarchical strokes from urban street networks based on spatial pattern recognition
Yang, B., Luan, X., & Li, Q. (2011) · International Journal of Geographical Information Systems · doi:10.1080/13658816.2011.570270 · Cited by 59
Packings by Complete Bipartite Graphs
Hell, P., & Kirkpatrick, D. G. (1986) · SIAM Journal on Algebraic and Discrete Methods · doi:10.1137/0607024 · Cited by 59
Bouchet, A. (1989) · Discrete Applied Mathematics · doi:10.1016/0166-218x(92)90272-c · Cited by 59
Greeding matching algorithms, an experimental study
Magun, J. (1998) · ACM Journal of Experimental Algorithmics · doi:10.1145/297096.297131 · Cited by 58
Kidney Exchange: An Operations Perspective
Itai Ashlagi, A., & Roth, A. E. (2021) · Management Science · doi:10.1287/mnsc.2020.3954 · Cited by 58
Online Matching with General Arrivals
Gamlath, B., Kapralov, M., Maggiori, A., Svensson, O., & Wajc, D. (2019) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2019.00011 · Cited by 58
Conservative weightings and ear-decompositions of graphs
Frank, A. (1993) · COMBINATORICA · doi:10.1007/bf01202790 · Cited by 58
The dependence graph for bases in matroids
Krogdahl, S. (1977) · Discrete Mathematics · doi:10.1016/0012-365x(77)90118-2 · Cited by 58
König-Egerváry graphs, 2-bicritical graphs and fractional matchings
Bourjolly, J.-M., & Pulleyblank, W. R. (1989) · Discrete Applied Mathematics · doi:10.1016/0166-218x(92)90273-d · Cited by 58
Optimizing Resource Efficiencies for Scalable Full-Stack Quantum Computers
Fellous-Asiani, M., Chai, J. H., Thonnart, Y., Ng, H. K., Whitney, R. S., & Auffèves, A. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.040319 · Cited by 85
Decoding algorithms for surface codes
deMarti iOlius, A., Fuentes, P., Orús, R., Crespo, P. M., & Etxezarreta Martinez, J. (2024) · Quantum · doi:10.22331/q-2024-10-10-1498 · Cited by 60
Lagrangian Relaxation Applied to Sparse Global Network Alignment
El-Kebir, M., Heringa, J., & Klau, G. W. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-24855-9_20 · Cited by 57
Metadata
- Authors
- Edmonds, J.
- Affiliations
- National Institute of Standards and Technology (US)
- Corresponding author
- Edmonds, Jack
- ORCID
- Edmonds, Jack
- Venue
- Canadian Journal of Mathematics
- Publisher
- Canadian Mathematical Society
- Published
- 1965
- Volume
- 17
- Pages
- 449-467
- ISSN
- 0008-414X (ISSN-L)
- 1496-4279
- OpenAlex
- W4233756358
- Cited by
- 2,428
- References
- 6
- Citations by year
- 2026: 80 · 2025: 108 · 2024: 100 · 2023: 110 · 2022: 126 · 2021: 107 · 2020: 134 · 2019: 118 · 2018: 110 · 2017: 91 · 2016: 84 · 2015: 72 · 2014: 83 · 2013: 80 · 2012: 73
- FWCI
- 0.83
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Canadian Journal of Mathematics (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Graph Theory and Algorithms
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Graph Theory Research
- Keywords
- maximum matching, graph theory, matching algorithms, trees, paths, graph algorithms
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
