Seonghyuk Im

From MaRDI portal
(Redirected from Seonghyuk Im)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Graph with any rational density and no rich subsets of linear size
(available as arXiv preprint)
N/APaper
Dirac's theorem for linear hypergraphs
(available as arXiv preprint)
N/APaper
Sidorenko's conjecture for subdivisions and theta substitutions
Combinatorics, Probability and Computing
2026-07-24Paper
Berge Hamilton cycles in a random sparsification of dense hypergraphs
(available as arXiv preprint)
2026-01-01Paper
The perturbation threshold of degenerate graphs
(available as arXiv preprint)
2026-01-01Paper
Hitting time for Hamilton cycles in pseudorandom graphs
(available as arXiv preprint)
2026-01-01Paper
Note on the codegree version of the Erdős--Ko--Rado theorem
(available as arXiv preprint)
2026-01-01Paper
On the enumeration of polymatroids
(available as arXiv preprint)
2026-01-01Paper
Bipodal optimizers in the upper-tail variational problem for regular subgraph densities
(available as arXiv preprint)
2026-01-01Paper
Goodman-type lower bounds for odd cycles I: The dense regime
(available as arXiv preprint)
2026-01-01Paper
The proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs
Discrete Applied Mathematics
2025-09-17Paper
Dirac's theorem for linear hypergraphs
SIAM Journal on Discrete Mathematics
2025-05-07Paper
On rainbow Turán densities of trees
Random Structures & Algorithms
2025-05-06Paper
Crux, space constraints and subdivisions (extended abstract)2025-04-15Paper
On high discrepancy 1-factorizations of complete graphs
(available as arXiv preprint)
2025-01-01Paper
Unbounded degree spanning hypertrees in Dirac hypergraphs
(available as arXiv preprint)
2025-01-01Paper
Perturbation of dense graphs
(available as arXiv preprint)
2025-01-01Paper
An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
(available as arXiv preprint)
2025-01-01Paper
Crux, space constraints and subdivisions
Journal of Combinatorial Theory. Series B
2024-12-12Paper
A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems
Forum of Mathematics, Sigma
2024-09-12Paper
On the spectral radius of graphs with given maximum degree and girth
Linear Algebra and its Applications
2024-04-25Paper
Sidorenko's conjecture for subdivisions and theta substitutions
(available as arXiv preprint)
2024-01-01Paper
Ramsey--Dirac theory for bounded degree hypertrees
(available as arXiv preprint)
2024-01-01Paper
On rainbow Tur\'{a}n Densities of Trees2023-12-26Paper
A bandwidth theorem for graph transversals2023-02-19Paper
A bandwidth theorem for graph transversals
(available as arXiv preprint)
2023-01-01Paper
A proof of the Elliott-R\"{o}dl conjecture on hypertrees in Steiner triple systems2022-08-22Paper
The proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs2022-08-17Paper
Crux, space constraints and subdivisions2022-07-14Paper
Complexity of Partitioning Hypergraphs2018-12-21Paper
Complexity of Partitioning Hypergraphs
(available as arXiv preprint)
2018-01-01Paper
On the mean square displacement of a random walk on a graph
European Journal of Combinatorics
2015-09-30Paper


Research outcomes over time


This page was built for person: Seonghyuk Im