Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

52 Publications


2026 | Published | Journal Article | IST-REx-ID: 21159 | OA | PlanS
Kwan, Matthew Alan, et al. “Counting Perfect Matchings in Dirac Hypergraphs.” Combinatorica, vol. 46, 5, Springer Nature, 2026, doi:10.1007/s00493-025-00194-8.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Journal Article | IST-REx-ID: 21884 | OA
Morawski, Patryk, and Kalina H. Petrova. “Randomly Perturbed Digraphs Also Have Bounded-Degree Spanning Trees.” Electronic Journal of Combinatorics, vol. 33, no. 2, P2.24, Electronic Journal of Combinatorics, 2026, doi:10.37236/13316.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Journal Article | IST-REx-ID: 20422 | OA | PlanS
Christoph, Micha, et al. “The Hamilton Space of Pseudorandom Graphs.” Journal of Combinatorial Theory Series B, vol. 176, Elsevier, 2026, pp. 254–67, doi:10.1016/j.jctb.2025.09.002.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2026 | Published | Journal Article | IST-REx-ID: 20482 | OA | PlanS
Boyadzhiyska, Simona, et al. “Odd-Ramsey Numbers of Complete Bipartite Graphs.” European Journal of Combinatorics, vol. 131, 104235, Elsevier, 2026, doi:10.1016/j.ejc.2025.104235.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2025 | Submitted | Preprint | IST-REx-ID: 21211 | OA
Montgomery, Richard, et al. “Packing Subdivisions into Regular Graphs.” ArXiv, 2508.00480, doi:10.48550/arXiv.2508.00480.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2025 | Epub ahead of print | Journal Article | IST-REx-ID: 21263 | OA | PlanS
Glasgow, Margalit, et al. “The Exact Rank of Sparse Random Graphs.” Journal of the European Mathematical Society, European Mathematical Society Press, 2025, doi:10.4171/jems/1692.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2025 | Published | Journal Article | IST-REx-ID: 21706 | OA | PlanS
Kwan, Matthew Alan, and Lisa Sauermann. “Resolution of the Quadratic Littlewood–Offord Problem.” Compositio Mathematica, vol. 161, no. 12, Cambridge University Press, 2025, pp. 3089–139, doi:10.1112/S0010437X25102789.
[Published Version] View | Files available | DOI | arXiv
 

2025 | Published | Journal Article | IST-REx-ID: 18478 | OA
Anastos, Michael, et al. “On the Chromatic Number of Powers of Subdivisions of Graphs.” Discrete Applied Mathematics, vol. 360, Elsevier, 2025, pp. 506–11, doi:10.1016/j.dam.2024.10.002.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2025 | Published | Journal Article | IST-REx-ID: 18753 | OA
Carbonero, Alvaro, et al. “On Heroes in Digraphs with Forbidden Induced Forests.” European Journal of Combinatorics, vol. 125, 104104, Elsevier, 2025, doi:10.1016/j.ejc.2024.104104.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2025 | Published | Journal Article | IST-REx-ID: 19002 | OA
Cortés, Pedro P., et al. “Subchromatic Numbers of Powers of Graphs with Excluded Minors.” Discrete Mathematics, vol. 348, no. 4, 114377, Elsevier, 2025, doi:10.1016/j.disc.2024.114377.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19017 | OA
Glock, Stefan, et al. “On the (k + 2, k)-Problem of Brown, Erdős, and Sós for k = 5,6,7.” Canadian Journal of Mathematics, Cambridge University Press, 2025, pp. 1–43, doi:10.4153/s0008414x25000021.
[Published Version] View | DOI | Download Published Version (ext.) | WoS | arXiv
 

2025 | Published | Journal Article | IST-REx-ID: 19018 | OA
Burova, Sofiya, and Lyuben Lichev. “The Semi-Random Tree Process.” European Journal of Combinatorics, vol. 126, 104120, Elsevier, 2025, doi:10.1016/j.ejc.2025.104120.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2025 | Published | Journal Article | IST-REx-ID: 19418 | OA
Draganić, Nemanja, and Kalina H. Petrova. “Size‐Ramsey Numbers of Graphs with Maximum Degree Three.” Journal of the London Mathematical Society, vol. 111, no. 3, e70116, Wiley, 2025, doi:10.1112/jlms.70116.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2025 | Published | Journal Article | IST-REx-ID: 19433 | OA
Anastos, Michael, et al. “Extremal, Enumerative and Probabilistic Results on Ordered Hypergraph Matchings.” Forum of Mathematics, Sigma, vol. 13, e55, Cambridge University Press, 2025, doi:10.1017/fms.2024.144.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2025 | Published | Journal Article | IST-REx-ID: 19440 | OA
Alon, Yahav, and Michael Anastos. “The Completion Numbers of Hamiltonicity and Pancyclicity in Random Graphs.” Random Structures and Algorithms, vol. 66, no. 2, e21286, Wiley, 2025, doi:10.1002/rsa.21286.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2025 | Published | Journal Article | IST-REx-ID: 19503 | OA
Christoph, Micha, et al. “A Note on Digraph Splitting.” Combinatorics Probability and Computing, vol. 34, no. 4, Cambridge University Press, 2025, pp. 559–64, doi:10.1017/S0963548325000045.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2025 | Published | Journal Article | IST-REx-ID: 19508 | OA | PlanS
Attia, Luc, et al. “Random Zero-Sum Dynamic Games on Infinite Directed Graphs.” Dynamic Games and Applications, vol. 15, Springer Nature, 2025, pp. 1517–35, doi:10.1007/s13235-025-00636-4.
[Published Version] View | Files available | DOI | WoS
 

2025 | Published | Journal Article | IST-REx-ID: 19554 | OA
Glasgow, Margalit, et al. “A Central Limit Theorem for the Matching Number of a Sparse Random Graph.” Journal of the London Mathematical Society, vol. 111, no. 4, e70101, Wiley, 2025, doi:10.1112/jlms.70101.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2025 | Published | Journal Article | IST-REx-ID: 19603 | OA
Lill, Jonas, et al. “Linear-Time MaxCut in Multigraphs Parameterized above the Poljak-Turzík Bound.” Algorithmica, vol. 87, Springer Nature, 2025, pp. 983–1007, doi:10.1007/s00453-025-01306-y.
[Published Version] View | Files available | DOI | WoS
 

2025 | Published | Journal Article | IST-REx-ID: 19798 | OA
Anastos, Michael, and Patrick Morris. “A Note on Finding Large Transversals Efficiently.” Journal of Combinatorial Designs, vol. 33, no. 9, Wiley, 2025, pp. 338–42, doi:10.1002/jcd.21990.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

Filters and Search Terms

department=MaKw

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed