Haoran Luo

From MaRDI portal
Person:2053727



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
Tur\'an density of long tight cycle minus one hyperedge
(available as arXiv preprint)
N/APaper
On the maximum number of r-cliques in graphs free of complete r-partite subgraphs
(available as arXiv preprint)
N/APaper
A jump in the codegree Turán densities of long tight cycles
IMRN. International Mathematics Research Notices
2026-07-09Paper
Theoretical collision model of elongated particles in turbulence
Journal of Fluid Mechanics
2026-04-29Paper
Maximum number of points in general position in a random subset of finite 3-dimensional spaces
(available as arXiv preprint)
2026-01-01Paper
A Jump in the Codegree Turán Densities of Long Tight Cycles
(available as arXiv preprint)
2026-01-01Paper
On the maximum density of r-graphs in which every (r+1)-set spans 0 or 2 edges
(available as arXiv preprint)
2026-01-01Paper
On the minimum size of maximal k-wise intersecting families
(available as arXiv preprint)
2026-01-01Paper
The number of sum-free subsets of lattice cubes
(available as arXiv preprint)
2026-01-01Paper
Non-degenerate hypergraphs with exponentially many extremal constructions
Journal of Combinatorial Theory. Series B
2025-09-16Paper
On the maximum number of r-cliques in graphs free of complete r-partite subgraphs
Discrete Mathematics
2025-05-26Paper
On the maximum F-free induced subgraphs in K_t-free graphs
Random Structures & Algorithms
2025-02-14Paper
Turán density of long tight cycle minus one hyperedge
Combinatorica
2025-01-14Paper
Multicolor Erdős--Rogers Functions
(available as arXiv preprint)
2025-01-01Paper
On the maximum \(F_5\)-free subhypergraphs of a random hypergraph
The Electronic Journal of Combinatorics
2024-02-16Paper
On the maximum F-free induced subgraphs in K_t-free graphs
(available as arXiv preprint)
2024-01-01Paper
On the thresholds of degenerate hypergraphs
(available as arXiv preprint)
2024-01-01Paper
Sharp threshold for the Erdős–Ko–Rado theorem
Random Structures & Algorithms
2023-10-17Paper
Non-degenerate Hypergraphs with Exponentially Many Extremal Constructions2022-08-01Paper
Maximal 3-wise Intersecting Families with Minimum Size: the Odd Case2022-06-19Paper
Maximal 3-wise Intersecting Families with Minimum Size: the Odd Case
(available as arXiv preprint)
2022-01-01Paper
On the number of forests and connected spanning subgraphs
Graphs and Combinatorics
2021-11-30Paper


Research outcomes over time


This page was built for person: Haoran Luo