The Library
Browse by Warwick Author
Up a level |
Jump to: Alexander von Humboldt Foundation | Berkman Faculty Development Fund | Carnegie Mellon University | Engineering and Physical Sciences Research Council (EPSRC) | European Research Council (ERC) | Fondation Sciences Mathématiques de Paris | Fundação para a Ciência e a Tecnologia (FCT) | Hungarian National Science Foundation | Hungary. Nemzeti Kutatási és Technológiai Hivatal [National Office for Research and Technology] (NKFIH) | Jan Grebík was supported by Leverhulme Research Project Grant RPG-2018-424. Oleg Pikhurko was supported by ERC Advanced Grant 101020255 and Leverhulme Research Project Grant RPG-2018-424. | KBN | Lady Davis Fellowship Trust | Leverhulme Trust (LT) | NSERC | NSF | National Science Foundation | National Science Foundation (NSF) | National Science Foundation (U.S.) (NSF) | Nederlandse Organisatie voor Wetenschappelijk Onderzoek [Netherlands Organisation for Scientific Research] (NWO) | Seventh Framework Programme (European Commission) (FP7) | Simons Foundation (SF) | Trinity College (University of Cambridge) | United States. National Security Agency (USNSA)
Number of items: 53.
Alexander von Humboldt Foundation
Pikhurko, Oleg and Yilma, Z. B. (2012) The maximum number of K3-free and K4-free edge 4-colorings. Journal of the London Mathematical Society, Vol.83 (No.3). pp. 593-615. doi:10.1112/jlms/jdr031 ISSN 0024-6107.
Berkman Faculty Development Fund
Bednarska, Małgorzata and Pikhurko, Oleg (2008) Odd and even cycles in Maker–Breaker games. European Journal of Combinatorics, Vol.29 (No.3). pp. 742-745. doi:10.1016/j.ejc.2007.02.017 ISSN 0195-6698.
Carnegie Mellon University
Bednarska, Małgorzata and Pikhurko, Oleg (2008) Odd and even cycles in Maker–Breaker games. European Journal of Combinatorics, Vol.29 (No.3). pp. 742-745. doi:10.1016/j.ejc.2007.02.017 ISSN 0195-6698.
Engineering and Physical Sciences Research Council (EPSRC)
Pikhurko, Oleg, Staden, Katherine and Yilma, Zelealem B. (2017) The Erdos-Rothschild problem on edge-colourings with forbidden monochromatic cliques. Mathematical Proceedings of the Cambridge Philosophical Society, 163 (2). pp. 341-356. doi:10.1017/S0305004116001031 ISSN 0305-0041.
Grabowski, Lukasz, Máthé, András and Pikhurko, Oleg (2017) Measurable circle squaring. Annals of Mathematics, 185 (2). pp. 671-710. doi:10.4007/annals.2017.185.2.6 ISSN 0003-486X.
Pikhurko, Oleg and Razborov, Alexander (2017) Asymptotic structure of graphs with the minimum number of triangles. Combinatorics, Probability and Computing, 26 (1). pp. 138-160. doi:10.1017/S0963548316000110 ISSN 0963-5483.
Csoka, Endre, Lippner, Gabor and Pikhurko, Oleg (2016) Kőnig's Line Coloring and Vizing's Theorems for Graphings. Forum of Mathematics, Sigma, 4 . e27. doi:10.1017/fms.2016.22 ISSN 2050-5094 .
DeCorte, E. and Pikhurko, Oleg (2016) Spherical sets avoiding a prescribed set of angles. International Mathematics Research Notices, 2016 (20). pp. 6095-6117. doi:10.1093/imrn/rnv319 ISSN 1073-7928.
Liu, Henry, Pikhurko, Oleg and Sousa, Teresa (2015) Monochromatic clique decompositions of graphs. Journal of Graph Theory, 80 (4). pp. 287-298. doi:10.1002/jgt.21851 ISSN 0364-9024.
Falgas-Ravry, Victor, Marchant, Edward, Pikhurko, Oleg and Vaughan, Emil R. (2015) The codegree threshold for 3-graphs with independent neighborhoods. SIAM Journal on Discrete Mathematics, 29 (3). pp. 1504-1539. doi:10.1137/130926997 ISSN 0895-4801.
Balogh, József, Hu, Ping, Lidicky, Bernard, Pikhurko, Oleg, Udvari, Balázs and Volec, Jan (2015) Minimum number of monotone subsequences of length 4 in permutations. Combinatorics, Probability and Computing, 24 (4). pp. 658-679. doi:10.1017/S0963548314000820 ISSN 0963-5483.
Hladký, Jan, Máthé, András, Patel, Viresh and Pikhurko, Oleg (2015) Poset limits can be totally ordered. American Mathematical Society. Transactions, 367 (6). pp. 4319-4337. doi:10.1090/S0002-9947-2015-06299-0 ISSN 0002-9947.
European Research Council (ERC)
Pikhurko, Oleg, Staden, Katherine and Yilma, Zelealem B. (2017) The Erdos-Rothschild problem on edge-colourings with forbidden monochromatic cliques. Mathematical Proceedings of the Cambridge Philosophical Society, 163 (2). pp. 341-356. doi:10.1017/S0305004116001031 ISSN 0305-0041.
Grabowski, Lukasz, Máthé, András and Pikhurko, Oleg (2017) Measurable circle squaring. Annals of Mathematics, 185 (2). pp. 671-710. doi:10.4007/annals.2017.185.2.6 ISSN 0003-486X.
Pikhurko, Oleg and Razborov, Alexander (2017) Asymptotic structure of graphs with the minimum number of triangles. Combinatorics, Probability and Computing, 26 (1). pp. 138-160. doi:10.1017/S0963548316000110 ISSN 0963-5483.
Csoka, Endre, Lippner, Gabor and Pikhurko, Oleg (2016) Kőnig's Line Coloring and Vizing's Theorems for Graphings. Forum of Mathematics, Sigma, 4 . e27. doi:10.1017/fms.2016.22 ISSN 2050-5094 .
DeCorte, E. and Pikhurko, Oleg (2016) Spherical sets avoiding a prescribed set of angles. International Mathematics Research Notices, 2016 (20). pp. 6095-6117. doi:10.1093/imrn/rnv319 ISSN 1073-7928.
Liu, Henry, Pikhurko, Oleg and Sousa, Teresa (2015) Monochromatic clique decompositions of graphs. Journal of Graph Theory, 80 (4). pp. 287-298. doi:10.1002/jgt.21851 ISSN 0364-9024.
Falgas-Ravry, Victor, Marchant, Edward, Pikhurko, Oleg and Vaughan, Emil R. (2015) The codegree threshold for 3-graphs with independent neighborhoods. SIAM Journal on Discrete Mathematics, 29 (3). pp. 1504-1539. doi:10.1137/130926997 ISSN 0895-4801.
Balogh, József, Hu, Ping, Lidicky, Bernard, Pikhurko, Oleg, Udvari, Balázs and Volec, Jan (2015) Minimum number of monotone subsequences of length 4 in permutations. Combinatorics, Probability and Computing, 24 (4). pp. 658-679. doi:10.1017/S0963548314000820 ISSN 0963-5483.
Hladký, Jan, Máthé, András, Patel, Viresh and Pikhurko, Oleg (2015) Poset limits can be totally ordered. American Mathematical Society. Transactions, 367 (6). pp. 4319-4337. doi:10.1090/S0002-9947-2015-06299-0 ISSN 0002-9947.
Král’, Daniel and Pikhurko, Oleg (2013) Quasirandom permutations are characterized by 4-point densities. Geometric and Functional Analysis, Volume 23 (Number 2). pp. 570-579. doi:10.1007/s00039-013-0216-9 ISSN 1016-443X.
Fondation Sciences Mathématiques de Paris
Grabowski, Lukasz, Máthé, András and Pikhurko, Oleg (2017) Measurable circle squaring. Annals of Mathematics, 185 (2). pp. 671-710. doi:10.4007/annals.2017.185.2.6 ISSN 0003-486X.
Fundação para a Ciência e a Tecnologia (FCT)
Liu, Henry, Pikhurko, Oleg and Sousa, Teresa (2015) Monochromatic clique decompositions of graphs. Journal of Graph Theory, 80 (4). pp. 287-298. doi:10.1002/jgt.21851 ISSN 0364-9024.
Hungarian National Science Foundation
Füredi, Zoltan, Mubayi, Dhruv and Pikhurko, Oleg (2008) Quadruple systems with independent neighborhoods. Journal of Combinatorial Theory, Series A, Vol.115 (No.8). pp. 1552-1560. doi:10.1016/j.jcta.2008.01.008 ISSN 0097-3165.
Hungary. Nemzeti Kutatási és Technológiai Hivatal [National Office for Research and Technology] (NKFIH)
Grabowski, Lukasz, Máthé, András and Pikhurko, Oleg (2017) Measurable circle squaring. Annals of Mathematics, 185 (2). pp. 671-710. doi:10.4007/annals.2017.185.2.6 ISSN 0003-486X.
Jan Grebík was supported by Leverhulme Research Project Grant RPG-2018-424. Oleg Pikhurko was supported by ERC Advanced Grant 101020255 and Leverhulme Research Project Grant RPG-2018-424.
Conley, Clinton T., Grebík, Jan and Pikhurko, Oleg (2024) Divisibility of spheres with measurable pieces. L'Enseignement Mathematique . doi:10.4171/LEM/1058 ISSN 0013-8584. (In Press)
KBN
Bednarska, Małgorzata and Pikhurko, Oleg (2008) Odd and even cycles in Maker–Breaker games. European Journal of Combinatorics, Vol.29 (No.3). pp. 742-745. doi:10.1016/j.ejc.2007.02.017 ISSN 0195-6698.
Lady Davis Fellowship Trust
DeCorte, E. and Pikhurko, Oleg (2016) Spherical sets avoiding a prescribed set of angles. International Mathematics Research Notices, 2016 (20). pp. 6095-6117. doi:10.1093/imrn/rnv319 ISSN 1073-7928.
Leverhulme Trust (LT)
Grabowski, Lukasz, Máthé, András and Pikhurko, Oleg (2017) Measurable circle squaring. Annals of Mathematics, 185 (2). pp. 671-710. doi:10.4007/annals.2017.185.2.6 ISSN 0003-486X.
NSERC
Haxell, Penny, Pikhurko, Oleg and Thomason, Andrew (2008) Maximum acyclic and fragmented sets in regular graphs. Journal of Graph Theory, Vol.57 (No.2). pp. 149-156. doi:10.1002/jgt.20271 ISSN 0364-9024.
NSF
Füredi, Zoltan, Mubayi, Dhruv and Pikhurko, Oleg (2008) Quadruple systems with independent neighborhoods. Journal of Combinatorial Theory, Series A, Vol.115 (No.8). pp. 1552-1560. doi:10.1016/j.jcta.2008.01.008 ISSN 0097-3165.
Haxell, Penny, Pikhurko, Oleg and Thomason, Andrew (2008) Maximum acyclic and fragmented sets in regular graphs. Journal of Graph Theory, Vol.57 (No.2). pp. 149-156. doi:10.1002/jgt.20271 ISSN 0364-9024.
Mubayi, Dhruv and Pikhurko, Oleg (2008) Constructions of non-principal families in extremal hypergraph theory. Discrete Mathematics, Vol.308 (No.19). pp. 4430-4434. doi:10.1016/j.disc.2007.08.040 ISSN 0012-365X.
Beveridge, Andrew, Bohman, Tom, Frieze, Alan and Pikhurko, Oleg (2008) Game chromatic index of graphs with given restrictions on degrees. Theoretical Computer Science, Vol.407 (No.1-3). pp. 242-249. doi:10.1016/j.tcs.2008.05.026 ISSN 0304-3975.
National Science Foundation
Pikhurko, Oleg and Yilma, Z. B. (2012) The maximum number of K3-free and K4-free edge 4-colorings. Journal of the London Mathematical Society, Vol.83 (No.3). pp. 593-615. doi:10.1112/jlms/jdr031 ISSN 0024-6107.
Pikhurko, Oleg (2012) A note on the Turán function of even cycles. Proceedings of the American Mathematical Society, Vol.140 (No.11). pp. 3687-3692. doi:10.1090/S0002-9939-2012-11274-2 ISSN 0002-9939.
Füredi, Zoltan, Mubayi, Dhruv and Pikhurko, Oleg (2008) Quadruple systems with independent neighborhoods. Journal of Combinatorial Theory, Series A, Vol.115 (No.8). pp. 1552-1560. doi:10.1016/j.jcta.2008.01.008 ISSN 0097-3165.
Beveridge, Andrew and Pikhurko, Oleg (2008) On the connectivity of extremal Ramsey graphs. Australasian Journal of Combinatorics, Vol.41 . pp. 57-61. ISSN 1034-4942.
Pikhurko, Oleg and Schmitt, John A note on minimum K2,3-saturated graphs. Australasian Journal of Combinatorics, Vol.40 . pp. 211-215. ISSN 1034-4942.
National Science Foundation (NSF)
Bednarska, Małgorzata and Pikhurko, Oleg (2008) Odd and even cycles in Maker–Breaker games. European Journal of Combinatorics, Vol.29 (No.3). pp. 742-745. doi:10.1016/j.ejc.2007.02.017 ISSN 0195-6698.
Pikhurko, Oleg (2008) Perfect matchings and K 4 3 -Tilings in hypergraphs of large codegree. Graphs and Combinatorics, Vol.24 (No.4). pp. 391-404. doi:10.1007/s00373-008-0787-7 ISSN 0911-0119.
National Science Foundation (U.S.) (NSF)
Balogh, József, Hu, Ping, Lidicky, Bernard, Pikhurko, Oleg, Udvari, Balázs and Volec, Jan (2015) Minimum number of monotone subsequences of length 4 in permutations. Combinatorics, Probability and Computing, 24 (4). pp. 658-679. doi:10.1017/S0963548314000820 ISSN 0963-5483.
Hladký, Jan, Máthé, András, Patel, Viresh and Pikhurko, Oleg (2015) Poset limits can be totally ordered. American Mathematical Society. Transactions, 367 (6). pp. 4319-4337. doi:10.1090/S0002-9947-2015-06299-0 ISSN 0002-9947.
Cooper, Alec S., Pikhurko, Oleg, Schmitt, John R. and Warrington, Gregory S. (2014) Martin Gardner’s minimum No-3-in-a-line problem. The American Mathematical Monthly, 121 (3). pp. 213-221. doi:10.4169/amer.math.monthly.121.03.213 ISSN 0002-9890.
Král’, Daniel and Pikhurko, Oleg (2013) Quasirandom permutations are characterized by 4-point densities. Geometric and Functional Analysis, Volume 23 (Number 2). pp. 570-579. doi:10.1007/s00039-013-0216-9 ISSN 1016-443X.
Nederlandse Organisatie voor Wetenschappelijk Onderzoek [Netherlands Organisation for Scientific Research] (NWO)
DeCorte, E. and Pikhurko, Oleg (2016) Spherical sets avoiding a prescribed set of angles. International Mathematics Research Notices, 2016 (20). pp. 6095-6117. doi:10.1093/imrn/rnv319 ISSN 1073-7928.
Seventh Framework Programme (European Commission) (FP7)
Balogh, József, Hu, Ping, Lidicky, Bernard, Pikhurko, Oleg, Udvari, Balázs and Volec, Jan (2015) Minimum number of monotone subsequences of length 4 in permutations. Combinatorics, Probability and Computing, 24 (4). pp. 658-679. doi:10.1017/S0963548314000820 ISSN 0963-5483.
Král’, Daniel and Pikhurko, Oleg (2013) Quasirandom permutations are characterized by 4-point densities. Geometric and Functional Analysis, Volume 23 (Number 2). pp. 570-579. doi:10.1007/s00039-013-0216-9 ISSN 1016-443X.
Simons Foundation (SF)
Balogh, József, Hu, Ping, Lidicky, Bernard, Pikhurko, Oleg, Udvari, Balázs and Volec, Jan (2015) Minimum number of monotone subsequences of length 4 in permutations. Combinatorics, Probability and Computing, 24 (4). pp. 658-679. doi:10.1017/S0963548314000820 ISSN 0963-5483.
Cooper, Alec S., Pikhurko, Oleg, Schmitt, John R. and Warrington, Gregory S. (2014) Martin Gardner’s minimum No-3-in-a-line problem. The American Mathematical Monthly, 121 (3). pp. 213-221. doi:10.4169/amer.math.monthly.121.03.213 ISSN 0002-9890.
Trinity College (University of Cambridge)
Falgas-Ravry, Victor, Marchant, Edward, Pikhurko, Oleg and Vaughan, Emil R. (2015) The codegree threshold for 3-graphs with independent neighborhoods. SIAM Journal on Discrete Mathematics, 29 (3). pp. 1504-1539. doi:10.1137/130926997 ISSN 0895-4801.
United States. National Security Agency (USNSA)
Cooper, Alec S., Pikhurko, Oleg, Schmitt, John R. and Warrington, Gregory S. (2014) Martin Gardner’s minimum No-3-in-a-line problem. The American Mathematical Monthly, 121 (3). pp. 213-221. doi:10.4169/amer.math.monthly.121.03.213 ISSN 0002-9890.
This list was generated on Sat Apr 20 02:30:05 2024 BST.