Hongliang Lu

activity

20232026

collaborators

11 papers

math.CO2026

Towards the Erdős matching conjecture for 4-uniform hypergraphs: stability and applications

Peter Frankl, Hongliang Lu, Jie Ma +1

A famous conjecture of Erdős asserts that for $k \geq 3$ , the maximum number of edges in an $n$ -vertex $k$ -uniform hypergraph without $s + 1$ pairwise disjoint edges is $\max\{\binom{n…

cs.CV2026

Q-DiT4SR: Exploration of Detail-Preserving Diffusion Transformer Quantization for Real-World Image Super-Resolution

Xun Zhang, Kaicheng Yang, Hongliang Lu +3

Recently, Diffusion Transformers (DiTs) have emerged in Real-World Image Super-Resolution (Real-ISR) to generate high-quality textures, yet their heavy inference burden hinders rea…

math.CO2025

Anti-Ramsey Number of Stars in 3-uniform hypergraphs

Hongliang Lu, Xinyue Luo, Xinxin Ma

An edge-colored hypergraph is called \emph{a rainbow hypergraph} if all the colors on its edges are distinct. Given two positive integers $n, r$ and an $r$ -uniform hypergraph $\math…

math.CO2025

Rainbow matchings in edge-colored graphs

Hongliang Lu, Zixuan Yang, Feihong Yuan

Let $G$ be an edge-colored graph. We use $e (G)$ and $c (G)$ to denote the number of edges and colors in $G$ , respectively. A subgraph $H$ is called rainbow if $c (H) = e (H)$ . Li et al.…

math.CO2025

Anti-Ramsey number of intersecting cliques

Hongliang Lu, Xinyue Luo, Xinxin Ma

An edge-colored graph is called a rainbow graph if all its edges have distinct colors. The anti-Ramsey number $a r (n, G)$ , for a graph $G$ and a positive integer $n$ , is defined as…

math.CO2025

New Bounds on the Anti-Ramsey Number of Independent Triangles

Hongliang Lu, Xinyue Luo, Xinxin Ma

An edge-colored graph is called \textit{rainbow graph} if all the colors on its edges are distinct. Given a positive integer $n$ and a graph $G$ , the \textit{anti-Ramsey number} $a…

math.CO2024

Matching stability for 3-partite 3-uniform hypergraphs

Hongliang Lu, Xinxin Ma

Let $n, k, s$ be three integers such that $k \geq 2$ and $n \geq s \geq 1$ . Let $H$ be a $k$ -partite $k$ -uniform hypergraph with $n$ vertices in each class. Aharoni (2017) showed that i…

math.CO2024

Discrepancies of perfect matchings in hypergraphs

Hongliang Lu, Jie Ma, Shengjie Xie

In this paper, we determine the minimum degree threshold of perfect matchings with high discrepancy in $r$ -edge-colored $k$ -uniform hypergraphs for all $k \geq 3$ and $r \geq 2$ , the…

math.CO2024

A characterization on $(g, f)$ -parity orientations

Hongliang Lu, Xinxin Ma

Let $G$ be a graph and $g, f : V (G) \to 2^{N}$ be two set functions such that $g (v) \leq f (v)$ and $g (v) \equiv f (v) (mod 2)$ for every $v \in V (G)$ . An orientation $O$ of $G$ is called a $(g,…

math.CO2023

Eigenvalues and factors: a survey

Dandan Fan, Huiqiu Lin, Hongliang Lu +1

A factor of a graph is a spanning subgraph satisfying some given conditions. An earlier survey of factors can be traced back to the Akiyama and Kano [J. Graph Theory, 1985, 9: 1-42…

math.CO2023

A characterization on orientations of graphs avoiding given lists on out-degrees

Xinxin Ma, Hongliang Lu

Let $G$ be a graph and $F : V (G) \to 2^{N}$ be a set function. The graph $G$ is said to be \emph{F-avoiding} if there exists an orientation $O$ of $G$ such that $d_{O}^{+} (v) \in / F (v)$ for…

Towards the Erdős matching conjecture for 4-uniform hypergraphs: stability and applications

Q-DiT4SR: Exploration of Detail-Preserving Diffusion Transformer Quantization for Real-World Image Super-Resolution

Anti-Ramsey Number of Stars in 3-uniform hypergraphs

Rainbow matchings in edge-colored graphs

Anti-Ramsey number of intersecting cliques

New Bounds on the Anti-Ramsey Number of Independent Triangles

Matching stability for 3-partite 3-uniform hypergraphs

Discrepancies of perfect matchings in hypergraphs

A characterization on (g,f)-parity orientations

Eigenvalues and factors: a survey

A characterization on orientations of graphs avoiding given lists on out-degrees

A characterization on $(g, f)$ -parity orientations