Zobrazeno 1 - 10
of 165
pro vyhledávání: '"Xu, Zixiang"'
Publikováno v:
Pattern Recognition and Computer Vision (2025), Springer Nature Singapore, pages 166-180, ISBN 978-981-97-8508-7
Reconstructing 3D models from single-view images is a long-standing problem in computer vision. The latest advances for single-image 3D reconstruction extract a textual description from the input image and further utilize it to synthesize 3D models.
Externí odkaz:
http://arxiv.org/abs/2411.12197
Celebrated results often unfold like episodes in a long-running series. In the field of extremal set thoery, Erd\H{o}s, Ko, and Rado in 1961 established that any $k$-uniform intersecting family on $[n]$ has a maximum size of $\binom{n-1}{k-1}$, with
Externí odkaz:
http://arxiv.org/abs/2410.22676
Generating high-quality meshes with complex structures and realistic surfaces is the primary goal of 3D generative models. Existing methods typically employ sequence data or deformable tetrahedral grids for mesh generation. However, sequence-based me
Externí odkaz:
http://arxiv.org/abs/2410.17802
A well-known theorem of Nikiforov asserts that any graph with a positive $K_{r}$-density contains a logarithmic blowup of $K_r$. In this paper, we explore variants of Nikiforov's result in the following form. Given $r,t\in\mathbb{N}$, when a positive
Externí odkaz:
http://arxiv.org/abs/2410.07098
Autor:
Cheng, Xinbu, Xu, Zixiang
A widely open conjecture proposed by Bollob\'as, Erd\H{o}s, and Tuza in the early 1990s states that for any $n$-vertex graph $G$, if the independence number $\alpha(G) = \Omega(n)$, then there is a subset $T \subseteq V(G)$ with $|T| = o(n)$ such tha
Externí odkaz:
http://arxiv.org/abs/2405.18264
Autor:
Cheng, Xinbu, Xu, Zixiang
For an $n$-vertex graph $G$, let $h(G)$ denote the smallest size of a subset of $V(G)$ such that it intersects every maximum independent set of $G$. A conjecture posed by Bollob\'{a}s, Erd\H{o}s and Tuza in early 90s remains widely open, asserting th
Externí odkaz:
http://arxiv.org/abs/2404.10379
Given a graph $G$, denote by $h(G)$ the smallest size of a subset of $V(G)$ which intersects every maximum independent set of $G$. We prove that any graph $G$ without induced matching of size $t$ satisfies $h(G)\le \omega(G)^{3t-3+o(1)}$. This resolv
Externí odkaz:
http://arxiv.org/abs/2403.19737
We establish a novel connection between the well-known chromatic threshold problem in extremal combinatorics and the celebrated $(p,q)$-theorem in discrete geometry. In particular, for a graph $G$ with bounded clique number and a natural density cond
Externí odkaz:
http://arxiv.org/abs/2403.17910
Motivated by an extremal problem on graph-codes that links coding theory and graph theory, Alon recently proposed a question aiming to find the smallest number $t$ such that there is an edge coloring of $K_{n}$ by $t$ colors with no copy of given gra
Externí odkaz:
http://arxiv.org/abs/2306.14682
Autor:
Cheng, Xinbu, Xu, Zixiang
The Euclidean Gallai-Ramsey problem, which investigates the existence of monochromatic or rainbow configurations in a colored $n$-dimensional Euclidean space $\mathbb{E}^{n}$, was introduced and studied recently. We further explore this problem for v
Externí odkaz:
http://arxiv.org/abs/2305.18218