Oliver Janzer

From MaRDI portal
(Redirected from Person:2001981)



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
An improved upper bound for the multicolour Ramsey number of odd cycles
Journal of Combinatorial Theory. Series B
2026-06-16Paper
Short monochromatic odd cycles
Mathematical Proceedings of the Cambridge Philosophical Society
2026-06-11Paper
The probability that a random graph is even-decomposable
Random Structures & Algorithms
2025-11-25Paper
Extremal number of graphs from geometric shapes
Israel Journal of Mathematics
2025-11-20Paper
Tight bounds for intersection-reverse sequences, edge-ordered graphs, and applications
Journal of the London Mathematical Society. Second Series
2025-11-19Paper
Power saving for the Brown-Erdős-Sós problem
Discrete Analysis
2025-09-19Paper
Rational exponents near two
Advances in Combinatorics
2025-04-29Paper
Extremal number of graphs from geometric shapes (extended abstract)2025-04-15Paper
Induced subgraphs of K_r-free graphs and the Erdős-Rogers problem
Combinatorica
2025-04-08Paper
Edge-disjoint cycles with the same vertex set
Advances in Mathematics
2025-04-07Paper
Tiling with monochromatic bipartite graphs of bounded maximum degree
Mathematika
2025-03-21Paper
Improved bounds for the Erdős-Rogers (s, s+2)-problem
Random Structures & Algorithms
2025-02-14Paper
Tight general bounds for the extremal numbers of 0-1 matrices
IMRN. International Mathematics Research Notices
2024-10-31Paper
Regular subgraphs of linear hypergraphs
IMRN. International Mathematics Research Notices
2024-10-31Paper
On locally rainbow colourings
Journal of Combinatorial Theory. Series B
2024-10-08Paper
Small subgraphs with large average degree
Combinatorica
2024-09-19Paper
On the Zarankiewicz problem for graphs with bounded VC-dimension
Combinatorica
2024-09-19Paper
On the generalized Turán problem for odd cycles
SIAM Journal on Discrete Mathematics
2024-09-17Paper
On the Turán number of the hypercube
Forum of Mathematics, Sigma
2024-03-19Paper
Power saving for the Brown-Erd\H{o}s-S\'os problem2023-11-21Paper
The maximum number of induced C5's in a planar graph
Journal of Graph Theory
2023-10-05Paper
Asymptotics of the hypergraph bipartite Turán problem
Combinatorica
2023-10-04Paper
On the generalized Tur\'an problem for odd cycles2023-09-22Paper
The Turán number of the grid
Bulletin of the London Mathematical Society
2023-08-23Paper
New results for MaxCut in H$H$‐free graphs
Journal of the London Mathematical Society
2023-08-23Paper
Resolution of the Erdős–Sauer problem on regular subgraphs
Forum of Mathematics, Pi
2023-08-10Paper
Disproof of a Conjecture of Erdős and Simonovits on the Turán Number of Graphs with Minimum Degree 3
IMRN. International Mathematics Research Notices
2023-05-31Paper
On MaxCut and the Lov\'asz theta function2023-05-29Paper
On locally rainbow colourings2023-04-24Paper
Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles
Israel Journal of Mathematics
2023-04-24Paper
Extremal number of graphs from geometric shapes2023-03-23Paper
Counting <i>H</i>-free orientations of graphs
Mathematical Proceedings of the Cambridge Philosophical Society
2022-12-20Paper
Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz
Designs, Codes and Cryptography
2022-08-31Paper
Regular subgraphs of linear hypergraphs2022-08-22Paper
Small subgraphs with large average degree2022-07-05Paper
The Turán number of blow-ups of trees
Journal of Combinatorial Theory. Series B
2022-06-10Paper
On the Turán number of the blow-up of the hexagon
SIAM Journal on Discrete Mathematics
2022-06-03Paper
Rational exponents near two2022-03-07Paper
More on the extremal number of subdivisions
Combinatorica
2021-10-25Paper
More on the extremal number of subdivisions
Combinatorica
2021-10-25Paper
Tiling with monochromatic bipartite graphs of bounded maximum degree2021-09-20Paper
The extremal number of longer subdivisions
Bulletin of the London Mathematical Society
2021-07-02Paper
Long directed paths in Eulerian digraphs2021-01-27Paper
Polynomial bound for the partition rank vs the analytic rank of tensors
discrete Analysis
2020-10-20Paper
Improved bounds for the Erdős-Rogers function
Advances in Combinatorics
2020-10-20Paper
On the Zarankiewicz problem for graphs with bounded VC-dimension2020-08-31Paper
Rainbow Tur\'an number of even cycles, repeated patterns and blow-ups of cycles
(available as arXiv preprint)
2020-06-01Paper
Subsets of Cayley graphs that induce many edges
Theory of Computing
2020-02-12Paper
The extremal number of the subdivisions of the complete bipartite graph
SIAM Journal on Discrete Mathematics
2020-01-16Paper
Improved bounds for the extremal number of subdivisions
The Electronic Journal of Combinatorics
2019-07-11Paper
Improved bounds for the extremal number of subdivisions
The Electronic Journal of Combinatorics
2019-07-11Paper
Low analytic rank implies low partition rank for tensors2018-09-28Paper
Improved bounds for the Erd\H{o}s-Rogers $(s,s+2)$-problem
(available as arXiv preprint)
N/APaper
Ordered Ramsey numbers of powers of paths
(available as arXiv preprint)
N/APaper
Tight general bounds for the extremal numbers of 0-1 matrices
(available as arXiv preprint)
N/APaper
Edge-disjoint cycles with the same vertex set
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Oliver Janzer