Kalina H Petrova
6 Publications
2025 | Published | Journal Article | IST-REx-ID: 19418 | 
N. Draganić and K. H. Petrova, “Size‐Ramsey numbers of graphs with maximum degree three,” Journal of the London Mathematical Society, vol. 111, no. 3. Wiley, 2025.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19503 |
M. Christoph, K. H. Petrova, and R. Steiner, “A note on digraph splitting,” Combinatorics Probability and Computing, vol. 34, no. 4. Cambridge University Press, pp. 559–564, 2025.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19603 |
J. Lill, K. H. Petrova, and S. Weber, “Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound,” Algorithmica. Springer Nature, 2025.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| WoS
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 20422 |
| 
|
M. Christoph, R. Nenadov, and K. H. Petrova, “The Hamilton space of pseudorandom graphs,” Journal of Combinatorial Theory Series B, vol. 176. Elsevier, pp. 254–267, 2025.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 20482 |
|
|
S. Boyadzhiyska, S. Das, T. Lesgourgues, and K. H. Petrova, “Odd-Ramsey numbers of complete bipartite graphs,” European Journal of Combinatorics, vol. 131. Elsevier, 2025.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18758 |
J. Lill, K. H. Petrova, and S. Weber, “Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound,” in 19th International Symposium on Parameterized and Exact Computation, Egham, United Kingdom, 2024, vol. 321.
[Published Version]
View
| Files available
| DOI
| arXiv
Grants
6 Publications
2025 | Published | Journal Article | IST-REx-ID: 19418 |
N. Draganić and K. H. Petrova, “Size‐Ramsey numbers of graphs with maximum degree three,” Journal of the London Mathematical Society, vol. 111, no. 3. Wiley, 2025.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19503 |
M. Christoph, K. H. Petrova, and R. Steiner, “A note on digraph splitting,” Combinatorics Probability and Computing, vol. 34, no. 4. Cambridge University Press, pp. 559–564, 2025.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19603 |
J. Lill, K. H. Petrova, and S. Weber, “Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound,” Algorithmica. Springer Nature, 2025.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| WoS
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 20422 |
|
|
M. Christoph, R. Nenadov, and K. H. Petrova, “The Hamilton space of pseudorandom graphs,” Journal of Combinatorial Theory Series B, vol. 176. Elsevier, pp. 254–267, 2025.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 20482 |
|
|
S. Boyadzhiyska, S. Das, T. Lesgourgues, and K. H. Petrova, “Odd-Ramsey numbers of complete bipartite graphs,” European Journal of Combinatorics, vol. 131. Elsevier, 2025.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18758 |
J. Lill, K. H. Petrova, and S. Weber, “Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound,” in 19th International Symposium on Parameterized and Exact Computation, Egham, United Kingdom, 2024, vol. 321.
[Published Version]
View
| Files available
| DOI
| arXiv