8 papers
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 , the maximum number of edges in an -vertex -uniform hypergraph without pairwise disjoint edges is $\max\{\binom{…
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…
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 and an -uniform hypergraph $\math…
Rainbow matchings in edge-colored graphs
Hongliang Lu, Zixuan Yang, Feihong Yuan
Let be an edge-colored graph. We use and to denote the number of edges and colors in , respectively. A subgraph is called rainbow if . Li et al.…
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 , for a graph and a positive integer , is defined as…
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 and a graph , the \textit{anti-Ramsey number} $a…