Triangle-free graph (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Triangle-free graph" in English language version.

refsWebsite

Global rank English rank

8doi.org

2^nd place

6semanticscholar.org

11^th place

8^th place

4arxiv.org

69^th place

59^th place

3ams.org

451^st place

277^th place

1acm.org

1,185^th place

840^th place

acm.org

dl.acm.org

Le Gall (2014), improving previous algorithms by Lee, Magniez & Santha (2013) and Belovs (2012). Le Gall, François (October 2014), "Improved quantum algorithm for triangle finding via combinatorial arguments", Proceedings of the 55th Annual Symposium on Foundations of Computer Science (FOCS 2014), IEEE, pp. 216–225, arXiv:1407.0085, doi:10.1109/focs.2014.31, ISBN 978-1-4799-6517-5, S2CID 5760574. Lee, Troy; Magniez, Frédéric; Santha, Miklos (2013), "Improved quantum query algorithms for triangle finding and associativity testing", Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013): New Orleans, Louisiana, USA, January 6–8, 2013, Association for Computing Machinery (ACM); Society for Industrial and Applied Mathematics (SIAM), pp. 1486–1502, ISBN 978-1-611972-51-1. Belovs, Aleksandrs (2012), "Span programs for functions with constant-sized 1-certificates", Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing (STOC '12), New York, NY, USA: ACM, pp. 77–84, arXiv:1105.4024, doi:10.1145/2213977.2213985, ISBN 978-1-4503-1245-5, S2CID 18771464.

ams.org

mathscinet.ams.org

Boppana & Halldórsson (1992) p. 184, based on an idea from an earlier coloring approximation algorithm of Avi Wigderson. Boppana, Ravi; Halldórsson, Magnús M. (1992), "Approximating maximum independent sets by excluding subgraphs", BIT, 32 (2): 180–196, doi:10.1007/BF01994876, MR 1172185, S2CID 123335474.
Erdős, Suen & Winkler (1995); Bohman (2009). Erdős, P.; Suen, S.; Winkler, P. (1995), "On the size of a random maximal graph", Random Structures and Algorithms, 6 (2–3): 309–318, doi:10.1002/rsa.3240060217. Bohman, Tom (2009), "The triangle-free process", Advances in Mathematics, 221 (5): 1653–1677, arXiv:0806.4375, doi:10.1016/j.aim.2009.02.018, MR 2522430, S2CID 17701040.
Alon, Ben-Shimon & Krivelevich (2010). Alon, Noga; Ben-Shimon, Sonny; Krivelevich, Michael (2010), "A note on regular Ramsey graphs", Journal of Graph Theory, 64 (3): 244–249, arXiv:0812.2386, doi:10.1002/jgt.20453, MR 2674496, S2CID 1784886.

arxiv.org

Abboud et al. (2022); Chan (2023); Jin & Xu (2023) Chan, Timothy M. (2023), "Finding triangles and other small subgraphs in geometric intersection graphs", in Bansal, Nikhil; Nagarajan, Viswanath (eds.), Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, {SIAM}, pp. 1777–1805, arXiv:2211.05345, doi:10.1137/1.9781611977554.ch68 Jin, Ce; Xu, Yinzhan (2023), "Removing additive structure in 3SUM-based reductions", in Saha, Barna; Servedio, Rocco A. (eds.), Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023, {ACM}, pp. 405–418, arXiv:2211.07048, doi:10.1145/3564246.3585157, S2CID 253510334
Le Gall (2014), improving previous algorithms by Lee, Magniez & Santha (2013) and Belovs (2012). Le Gall, François (October 2014), "Improved quantum algorithm for triangle finding via combinatorial arguments", Proceedings of the 55th Annual Symposium on Foundations of Computer Science (FOCS 2014), IEEE, pp. 216–225, arXiv:1407.0085, doi:10.1109/focs.2014.31, ISBN 978-1-4799-6517-5, S2CID 5760574. Lee, Troy; Magniez, Frédéric; Santha, Miklos (2013), "Improved quantum query algorithms for triangle finding and associativity testing", Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013): New Orleans, Louisiana, USA, January 6–8, 2013, Association for Computing Machinery (ACM); Society for Industrial and Applied Mathematics (SIAM), pp. 1486–1502, ISBN 978-1-611972-51-1. Belovs, Aleksandrs (2012), "Span programs for functions with constant-sized 1-certificates", Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing (STOC '12), New York, NY, USA: ACM, pp. 77–84, arXiv:1105.4024, doi:10.1145/2213977.2213985, ISBN 978-1-4503-1245-5, S2CID 18771464.
Erdős, Suen & Winkler (1995); Bohman (2009). Erdős, P.; Suen, S.; Winkler, P. (1995), "On the size of a random maximal graph", Random Structures and Algorithms, 6 (2–3): 309–318, doi:10.1002/rsa.3240060217. Bohman, Tom (2009), "The triangle-free process", Advances in Mathematics, 221 (5): 1653–1677, arXiv:0806.4375, doi:10.1016/j.aim.2009.02.018, MR 2522430, S2CID 17701040.
Alon, Ben-Shimon & Krivelevich (2010). Alon, Noga; Ben-Shimon, Sonny; Krivelevich, Michael (2010), "A note on regular Ramsey graphs", Journal of Graph Theory, 64 (3): 244–249, arXiv:0812.2386, doi:10.1002/jgt.20453, MR 2674496, S2CID 1784886.

doi.org

Abboud et al. (2022); Chan (2023); Jin & Xu (2023) Chan, Timothy M. (2023), "Finding triangles and other small subgraphs in geometric intersection graphs", in Bansal, Nikhil; Nagarajan, Viswanath (eds.), Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, {SIAM}, pp. 1777–1805, arXiv:2211.05345, doi:10.1137/1.9781611977554.ch68 Jin, Ce; Xu, Yinzhan (2023), "Removing additive structure in 3SUM-based reductions", in Saha, Barna; Servedio, Rocco A. (eds.), Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023, {ACM}, pp. 405–418, arXiv:2211.07048, doi:10.1145/3564246.3585157, S2CID 253510334
Le Gall (2014), improving previous algorithms by Lee, Magniez & Santha (2013) and Belovs (2012). Le Gall, François (October 2014), "Improved quantum algorithm for triangle finding via combinatorial arguments", Proceedings of the 55th Annual Symposium on Foundations of Computer Science (FOCS 2014), IEEE, pp. 216–225, arXiv:1407.0085, doi:10.1109/focs.2014.31, ISBN 978-1-4799-6517-5, S2CID 5760574. Lee, Troy; Magniez, Frédéric; Santha, Miklos (2013), "Improved quantum query algorithms for triangle finding and associativity testing", Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013): New Orleans, Louisiana, USA, January 6–8, 2013, Association for Computing Machinery (ACM); Society for Industrial and Applied Mathematics (SIAM), pp. 1486–1502, ISBN 978-1-611972-51-1. Belovs, Aleksandrs (2012), "Span programs for functions with constant-sized 1-certificates", Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing (STOC '12), New York, NY, USA: ACM, pp. 77–84, arXiv:1105.4024, doi:10.1145/2213977.2213985, ISBN 978-1-4503-1245-5, S2CID 18771464.
Boppana & Halldórsson (1992) p. 184, based on an idea from an earlier coloring approximation algorithm of Avi Wigderson. Boppana, Ravi; Halldórsson, Magnús M. (1992), "Approximating maximum independent sets by excluding subgraphs", BIT, 32 (2): 180–196, doi:10.1007/BF01994876, MR 1172185, S2CID 123335474.
Kim (1995). Kim, J. H. (1995), "The Ramsey number $R(3,t)$ has order of magnitude ${\tfrac {t^{2}}{\log t}}$ ", Random Structures and Algorithms, 7 (3): 173–207, doi:10.1002/rsa.3240070302, S2CID 16658980.
Erdős, Suen & Winkler (1995); Bohman (2009). Erdős, P.; Suen, S.; Winkler, P. (1995), "On the size of a random maximal graph", Random Structures and Algorithms, 6 (2–3): 309–318, doi:10.1002/rsa.3240060217. Bohman, Tom (2009), "The triangle-free process", Advances in Mathematics, 221 (5): 1653–1677, arXiv:0806.4375, doi:10.1016/j.aim.2009.02.018, MR 2522430, S2CID 17701040.
Alon, Ben-Shimon & Krivelevich (2010). Alon, Noga; Ben-Shimon, Sonny; Krivelevich, Michael (2010), "A note on regular Ramsey graphs", Journal of Graph Theory, 64 (3): 244–249, arXiv:0812.2386, doi:10.1002/jgt.20453, MR 2674496, S2CID 1784886.
Grötzsch (1959); Thomassen (1994)). Grötzsch, H. (1959), "Zur Theorie der diskreten Gebilde, VII: Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel", Wiss. Z. Martin-Luther-U., Halle-Wittenberg, Math.-Nat. Reihe, 8: 109–120. Thomassen, C. (1994), "Grötzsch's 3-color theorem", Journal of Combinatorial Theory, Series B, 62 (2): 268–279, doi:10.1006/jctb.1994.1069.
see Erdős & Simonovits (1973). Erdős, P.; Simonovits, M. (1973), "On a valence problem in extremal graph theory", Discrete Mathematics, 5 (4): 323–334, doi:10.1016/0012-365X(73)90126-X.

semanticscholar.org

api.semanticscholar.org

Abboud et al. (2022); Chan (2023); Jin & Xu (2023) Chan, Timothy M. (2023), "Finding triangles and other small subgraphs in geometric intersection graphs", in Bansal, Nikhil; Nagarajan, Viswanath (eds.), Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, {SIAM}, pp. 1777–1805, arXiv:2211.05345, doi:10.1137/1.9781611977554.ch68 Jin, Ce; Xu, Yinzhan (2023), "Removing additive structure in 3SUM-based reductions", in Saha, Barna; Servedio, Rocco A. (eds.), Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023, {ACM}, pp. 405–418, arXiv:2211.07048, doi:10.1145/3564246.3585157, S2CID 253510334
Le Gall (2014), improving previous algorithms by Lee, Magniez & Santha (2013) and Belovs (2012). Le Gall, François (October 2014), "Improved quantum algorithm for triangle finding via combinatorial arguments", Proceedings of the 55th Annual Symposium on Foundations of Computer Science (FOCS 2014), IEEE, pp. 216–225, arXiv:1407.0085, doi:10.1109/focs.2014.31, ISBN 978-1-4799-6517-5, S2CID 5760574. Lee, Troy; Magniez, Frédéric; Santha, Miklos (2013), "Improved quantum query algorithms for triangle finding and associativity testing", Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013): New Orleans, Louisiana, USA, January 6–8, 2013, Association for Computing Machinery (ACM); Society for Industrial and Applied Mathematics (SIAM), pp. 1486–1502, ISBN 978-1-611972-51-1. Belovs, Aleksandrs (2012), "Span programs for functions with constant-sized 1-certificates", Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing (STOC '12), New York, NY, USA: ACM, pp. 77–84, arXiv:1105.4024, doi:10.1145/2213977.2213985, ISBN 978-1-4503-1245-5, S2CID 18771464.
Boppana & Halldórsson (1992) p. 184, based on an idea from an earlier coloring approximation algorithm of Avi Wigderson. Boppana, Ravi; Halldórsson, Magnús M. (1992), "Approximating maximum independent sets by excluding subgraphs", BIT, 32 (2): 180–196, doi:10.1007/BF01994876, MR 1172185, S2CID 123335474.
Kim (1995). Kim, J. H. (1995), "The Ramsey number $R(3,t)$ has order of magnitude ${\tfrac {t^{2}}{\log t}}$ ", Random Structures and Algorithms, 7 (3): 173–207, doi:10.1002/rsa.3240070302, S2CID 16658980.
Erdős, Suen & Winkler (1995); Bohman (2009). Erdős, P.; Suen, S.; Winkler, P. (1995), "On the size of a random maximal graph", Random Structures and Algorithms, 6 (2–3): 309–318, doi:10.1002/rsa.3240060217. Bohman, Tom (2009), "The triangle-free process", Advances in Mathematics, 221 (5): 1653–1677, arXiv:0806.4375, doi:10.1016/j.aim.2009.02.018, MR 2522430, S2CID 17701040.
Alon, Ben-Shimon & Krivelevich (2010). Alon, Noga; Ben-Shimon, Sonny; Krivelevich, Michael (2010), "A note on regular Ramsey graphs", Journal of Graph Theory, 64 (3): 244–249, arXiv:0812.2386, doi:10.1002/jgt.20453, MR 2674496, S2CID 1784886.