The following pages link to Oliver Janzer (Q2001981):
Displaying 22 items.
- Improved bounds for the extremal number of subdivisions (Q2001982) (← links)
- Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz (Q2168069) (← links)
- More on the extremal number of subdivisions (Q2236656) (← links)
- The Turán number of blow-ups of trees (Q2673488) (← links)
- Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles (Q2698445) (← links)
- The extremal number of longer subdivisions (Q4996899) (← links)
- Counting <i>H</i>-free orientations of graphs (Q5058452) (← links)
- Improved bounds for the Erdős-Rogers function (Q5126754) (← links)
- Polynomial bound for the partition rank vs the analytic rank of tensors (Q5126770) (← links)
- The Extremal Number of the Subdivisions of the Complete Bipartite Graph (Q5210907) (← links)
- Subsets of Cayley graphs that induce many edges (Q5215667) (← links)
- On the Turán Number of the Blow-Up of the Hexagon (Q5864212) (← links)
- The maximum number of induced C5's in a planar graph (Q6057646) (← links)
- Asymptotics of the hypergraph bipartite Turán problem (Q6081375) (← links)
- Disproof of a Conjecture of Erdős and Simonovits on the Turán Number of Graphs with Minimum Degree 3 (Q6101105) (← links)
- New results for MaxCut in H$H$‐free graphs (Q6134889) (← links)
- Resolution of the Erdős–Sauer problem on regular subgraphs (Q6169130) (← links)
- The Turán number of the grid (Q6176592) (← links)
- On the Turán number of the hypercube (Q6193735) (← links)
- Rational exponents near two (Q6393015) (← links)
- Small subgraphs with large average degree (Q6404075) (← links)
- On MaxCut and the Lov\'asz theta function (Q6438366) (← links)
