Forcing graph (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Forcing graph" in English language version.

refsWebsite

Global rank English rank

2^nd place

5^th place

11^th place

8^th place

69^th place

59^th place

451^st place

277^th place

ams.org

Hancock, Robert; Kabela, Adam; Král', Daniel; Martins, Taísa; Parente, Roberto; Skerman, Fiona; Volec, Jan (2023). "No additional tournaments are quasirandom-forcing". European Journal of Combinatorics. 108: Paper No. 103632, 10. arXiv:1912.04243. doi:10.1016/j.ejc.2022.103632. MR 4502205.

Hancock, Robert; Kabela, Adam; Král', Daniel; Martins, Taísa; Parente, Roberto; Skerman, Fiona; Volec, Jan (2023). "No additional tournaments are quasirandom-forcing". European Journal of Combinatorics. 108: Paper No. 103632, 10. arXiv:1912.04243. doi:10.1016/j.ejc.2022.103632. MR 4502205.
Conlon, David; Fox, Jacob; Sudakov, Benny (2010-10-20). "An Approximate Version of Sidorenko's Conjecture". Geometric and Functional Analysis. 20 (6): 1354–1366. arXiv:1004.4236. doi:10.1007/s00039-010-0097-0. ISSN 1016-443X. S2CID 1872674.

Chung, F. R. K.; Graham, R. L.; Wilson, R. M. (1989-12-01). "Quasi-random graphs". Combinatorica. 9 (4): 345–362. doi:10.1007/BF02125347. ISSN 1439-6912. S2CID 17166765.
Hancock, Robert; Kabela, Adam; Král', Daniel; Martins, Taísa; Parente, Roberto; Skerman, Fiona; Volec, Jan (2023). "No additional tournaments are quasirandom-forcing". European Journal of Combinatorics. 108: Paper No. 103632, 10. arXiv:1912.04243. doi:10.1016/j.ejc.2022.103632. MR 4502205.
Conlon, David; Fox, Jacob; Sudakov, Benny (2010-10-20). "An Approximate Version of Sidorenko's Conjecture". Geometric and Functional Analysis. 20 (6): 1354–1366. arXiv:1004.4236. doi:10.1007/s00039-010-0097-0. ISSN 1016-443X. S2CID 1872674.
Skokan, Jozef; Thoma, Lubos (2004-06-01). "Bipartite Subgraphs and Quasi-Randomness". Graphs and Combinatorics. 20 (2): 255–262. doi:10.1007/s00373-004-0556-1. ISSN 0911-0119. S2CID 2154492.
SIDORENKO, A. F. (1992). "Inequalities for functionals generated by bipartite graphs". Discrete Mathematics and Applications. 2 (5). doi:10.1515/dma.1992.2.5.489. ISSN 0924-9265. S2CID 117471984.

Chung, F. R. K.; Graham, R. L.; Wilson, R. M. (1989-12-01). "Quasi-random graphs". Combinatorica. 9 (4): 345–362. doi:10.1007/BF02125347. ISSN 1439-6912. S2CID 17166765.
Conlon, David; Fox, Jacob; Sudakov, Benny (2010-10-20). "An Approximate Version of Sidorenko's Conjecture". Geometric and Functional Analysis. 20 (6): 1354–1366. arXiv:1004.4236. doi:10.1007/s00039-010-0097-0. ISSN 1016-443X. S2CID 1872674.
Skokan, Jozef; Thoma, Lubos (2004-06-01). "Bipartite Subgraphs and Quasi-Randomness". Graphs and Combinatorics. 20 (2): 255–262. doi:10.1007/s00373-004-0556-1. ISSN 0911-0119. S2CID 2154492.
SIDORENKO, A. F. (1992). "Inequalities for functionals generated by bipartite graphs". Discrete Mathematics and Applications. 2 (5). doi:10.1515/dma.1992.2.5.489. ISSN 0924-9265. S2CID 117471984.

Chung, F. R. K.; Graham, R. L.; Wilson, R. M. (1989-12-01). "Quasi-random graphs". Combinatorica. 9 (4): 345–362. doi:10.1007/BF02125347. ISSN 1439-6912. S2CID 17166765.
Conlon, David; Fox, Jacob; Sudakov, Benny (2010-10-20). "An Approximate Version of Sidorenko's Conjecture". Geometric and Functional Analysis. 20 (6): 1354–1366. arXiv:1004.4236. doi:10.1007/s00039-010-0097-0. ISSN 1016-443X. S2CID 1872674.
Skokan, Jozef; Thoma, Lubos (2004-06-01). "Bipartite Subgraphs and Quasi-Randomness". Graphs and Combinatorics. 20 (2): 255–262. doi:10.1007/s00373-004-0556-1. ISSN 0911-0119. S2CID 2154492.
SIDORENKO, A. F. (1992). "Inequalities for functionals generated by bipartite graphs". Discrete Mathematics and Applications. 2 (5). doi:10.1515/dma.1992.2.5.489. ISSN 0924-9265. S2CID 117471984.