Query：
学者姓名：曾庆厚
Refining：
Year
Type
Indexed by
Source
Complex
Co-
Language
Clean All
Abstract ：
Given two graphs H and F, the maximum possible number of copies of H in an F-free graph on n vertices is denoted by ex(n, H, F). Let l F denote t vertex disjoint copies of F. Gy6ri and Li (2012) obtained results on ex(n, C-3, C2k+1), which was further improved by Alon and Shikhelman (2016). In this paper, we determine the exact value of ex(n, C-3, B C2k+1) and its extremal graph for all l >= 2 and large n. (c) 2024 Elsevier B.V. All rights reserved.
Keyword ：
Cycle Cycle Extremal graph Extremal graph Generalized Tur & aacute;n number Generalized Tur & aacute;n number
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Hou, Jianfeng , Yang, Caihong , Zeng, Qinghou . Counting triangles in graphs without vertex disjoint odd cycles [J]. | DISCRETE MATHEMATICS , 2024 , 347 (7) . |
| MLA | Hou, Jianfeng 等. "Counting triangles in graphs without vertex disjoint odd cycles" . | DISCRETE MATHEMATICS 347 . 7 (2024) . |
| APA | Hou, Jianfeng , Yang, Caihong , Zeng, Qinghou . Counting triangles in graphs without vertex disjoint odd cycles . | DISCRETE MATHEMATICS , 2024 , 347 (7) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
In large-scale surveillance of urban or rural areas, an effective placement of cameras is critical in maximizing surveillance coverage or minimizing economic cost of cameras. Existing Surveillance Camera Placement (SCP) methods generally focus on physical coverage of surveillance by implicitly assuming uniform distribution of interested targets or objects across all blocks, which is, however, uncommon in real-world scenarios. In this paper, we are the first to propose a target-aware SCP (tSCP) model, which prioritizes optimizing the task based on uneven target densities, allowing cameras to preferentially cover blocks with more interested targets. First, we define target density as the likelihood of interested targets occurring in a block, which is positively correlated with the importance of the block. Second, we combine aerial imagery with a lightweight object detection network to identify target density. Third, we formulate tSCP as an optimization problem to maximize target coverage in surveillance area, and solve this problem with a target-guided genetic algorithm. Our method optimizes the rational and economical utilization of cameras in large-scale video survillance. Compared with the state-of-the-art methods, our tSCP achieves the highest target coverage with a fixed number of cameras (8.31%-14.81% more than its peers), or utilizes the minimum number of cameras to achieve a preset target coverage. Codes are available at https://github.com/wu-hongxin/tSCP_main. IEEE
Keyword ：
Internet of Things (IoT) Internet of Things (IoT) large-scale video surveillance large-scale video surveillance smart city smart city Surveillance Camera Placement (SCP) Surveillance Camera Placement (SCP)
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Wu, H. , Zeng, Q. , Guo, C. et al. Target-Aware Camera Placement for Large-Scale Video Surveillance [J]. | IEEE Transactions on Circuits and Systems for Video Technology , 2024 : 1-1 . |
| MLA | Wu, H. et al. "Target-Aware Camera Placement for Large-Scale Video Surveillance" . | IEEE Transactions on Circuits and Systems for Video Technology (2024) : 1-1 . |
| APA | Wu, H. , Zeng, Q. , Guo, C. , Zhao, T. , Chen, C.W. . Target-Aware Camera Placement for Large-Scale Video Surveillance . | IEEE Transactions on Circuits and Systems for Video Technology , 2024 , 1-1 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
For any positive integer k, let C(k) denote the least integer such that any n-vertex graph has an induced subgraph with at least n - C(k) vertices, in which at least min{k, n - C(k)} vertices are of the same degree. Caro, Shapira and Yuster initially studied this parameter and showed that S2(k log k) < C(k) < (8k)k. For the first nontrivial case, the authors proved that 3 < C(3) < 6, and the exact value was left as an open problem. In this paper, we first show that 3 < C(3) < 4, improving the former result as well as a recent result of Kogan. For special families of graphs, we prove that C(3) = 3 for K5-free graphs, and C(3) = 1 for large C2s+1-free graphs. In addition, extending a result of Erdos, Fajtlowicz and Staton, we assert that every Kr-free graph is an induced subgraph of a Kr-free graph in which no degree occurs more than three times.(c) 2023 Elsevier B.V. All rights reserved.
Keyword ：
H-free graph H-free graph Induced subgraph Induced subgraph Repeated degree Repeated degree
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Sun, Gaoxing , Hou, Jianfeng , Zeng, Qinghou . Large induced subgraphs with three repeated degrees [J]. | DISCRETE MATHEMATICS , 2023 , 346 (5) . |
| MLA | Sun, Gaoxing et al. "Large induced subgraphs with three repeated degrees" . | DISCRETE MATHEMATICS 346 . 5 (2023) . |
| APA | Sun, Gaoxing , Hou, Jianfeng , Zeng, Qinghou . Large induced subgraphs with three repeated degrees . | DISCRETE MATHEMATICS , 2023 , 346 (5) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
给定一个r-一致超图F, F的Turán数exr(n, F)表示n个顶点不含F作为子图的r-一致超图的最大边数.当r≥3时,确定exr(n, F)是一件非常困难的事情,尤其是当exr(n, F)=o(n~r)时.对于一个图F,F的扩张F+是指在图F的每条边上添加r-2个新的点所得到的r-一致超图;F的Berge超图Berge-F是一个r-一致超图H,满足V (F)?V (H)并且存在一个从E(F)到E(H)的双射f,使得对于每个e∈E(F),e?f (e).在本文中,我们确定超图中超星不交并的扩张及其Berge超图的Turán数,这是Khormali和Palmer[14]的结果的推广.
Keyword ：
Berge超图 Berge超图 Turán数 Turán数 扩张 扩张 星 星
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 邓静华 , 侯建锋 , 曾庆厚 et al. 超图中超星不交并的Turán数（英文） [J]. | 数学理论与应用 , 2023 , 43 (01) : 64-73 . |
| MLA | 邓静华 et al. "超图中超星不交并的Turán数（英文）" . | 数学理论与应用 43 . 01 (2023) : 64-73 . |
| APA | 邓静华 , 侯建锋 , 曾庆厚 , 张一枭 . 超图中超星不交并的Turán数（英文） . | 数学理论与应用 , 2023 , 43 (01) , 64-73 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
The Tur & aacute;n number of a graph H, ex(n, H), is the maximum number of edges in an n-vertex graph that does not contain H as a subgraph. Let P(k )denote the path on k vertices and let Um of Pki for 1 <= i <= m; in particular, write U-i=1(m) P-ki denote the disjoint union for all 1 <= i <= m. Yuan and Zhang determined ex(n, U-i=1(m) P-ki = mP(k) if k(i) = k i=1 P-ki) for all integers n if at most one of k(1), ... , k(m) is odd. Much less is known for all integers n if at least two of k(1), ... , k(m) are odd. Partial results such as ex(n, mP(3)), ex(n, P-3 boolean OR P2l+1), (n, 2P(5)), ex(n, 2P(7)) and ex(n, 3P(5)) have been established by several researchers. In this paper, we develop new functions and determine ex(n, 3P(7)) and ex(n, 2P(3) boolean OR P2l+1) for all integers n. We also characterize all the extremal graphs. Both results contribute to a conjecture of Yuan and Zhang.
Keyword ：
disjoint paths disjoint paths extremal graph extremal graph Turan number Turan number
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Deng, Jinghua , Hou, Jianfeng , Zeng, Qinghou . THE TURÁN NUMBER OF THREE DISJOINT PATHS [J]. | DISCUSSIONES MATHEMATICAE GRAPH THEORY , 2023 , 44 (4) : 1513-1537 . |
| MLA | Deng, Jinghua et al. "THE TURÁN NUMBER OF THREE DISJOINT PATHS" . | DISCUSSIONES MATHEMATICAE GRAPH THEORY 44 . 4 (2023) : 1513-1537 . |
| APA | Deng, Jinghua , Hou, Jianfeng , Zeng, Qinghou . THE TURÁN NUMBER OF THREE DISJOINT PATHS . | DISCUSSIONES MATHEMATICAE GRAPH THEORY , 2023 , 44 (4) , 1513-1537 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
设G=(V,E)是一个顶点数为n的图，给定一个边权重函数f:E→{+1,-1}.如果对于任意一条边e∈E,都满足所有与边e有公共端点的边e~*(包括边e)的权重f(e~*)的和大于或等于1,那么我们称这个函数f是图G的一个符号边控制函数.图G的符号边控制数定义为■,其中f是G的一个符号边控制函数.本文主要研究任意无三角形图的符号边控制数的下界.
Keyword ：
无三角形图 无三角形图 符号边控制函数 符号边控制函数 符号边控制数 符号边控制数
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 潘晨佳 , 曾庆厚 . 无三角形图的符号边控制数下界 [J]. | 青海师范大学学报(自然科学版) , 2023 , 39 (04) : 53-57 . |
| MLA | 潘晨佳 et al. "无三角形图的符号边控制数下界" . | 青海师范大学学报(自然科学版) 39 . 04 (2023) : 53-57 . |
| APA | 潘晨佳 , 曾庆厚 . 无三角形图的符号边控制数下界 . | 青海师范大学学报(自然科学版) , 2023 , 39 (04) , 53-57 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
A long-standing conjecture asserts that there is a positive constant c such that every n-vertex graph without isolated vertices contains an induced subgraph with all degrees odd on at least cn vertices. Recently, Ferber and Krivelevich confirmed the conjecture with c >= 10(-4). However, this is far from optimal for special family of graphs. Scott proved that c >= (2 chi)(-1) for graphs with chromatic number chi >= 2 and conjectured that c >= chi(-1). Partial tight bounds of c are also established by various authors for graphs such as trees, graphs with maximum degree 3 or K-4-minor-free graphs. In this paper, we further prove that c >= 2/5 for planar graphs with girth at least 7, and the bound is tight. We also show that c <= 1/3 for general planar graphs and c >= 1/3 for planar graphs with girth at least 6.
Keyword ：
Girth Girth Induced subgraph Induced subgraph Odd graph Odd graph Planar graph Planar graph
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Rao, Mengjiao , Hou, Jianfeng , Zeng, Qinghou . Odd Induced Subgraphs in Planar Graphs with Large Girth [J]. | GRAPHS AND COMBINATORICS , 2022 , 38 (4) . |
| MLA | Rao, Mengjiao et al. "Odd Induced Subgraphs in Planar Graphs with Large Girth" . | GRAPHS AND COMBINATORICS 38 . 4 (2022) . |
| APA | Rao, Mengjiao , Hou, Jianfeng , Zeng, Qinghou . Odd Induced Subgraphs in Planar Graphs with Large Girth . | GRAPHS AND COMBINATORICS , 2022 , 38 (4) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
A bisection of a graph is a bipartition of its vertex set in which the number of vertices in the two parts differ by at most 1, and its size is the number of edges which go across the two parts. Let C-k be a cycle of length k, and let G be a C-4-free graph with n vertices, m edges and vertex degrees d1, ... , dn. Lin and Zeng proved that if G does not contain C-6 and has a perfect matching, then G admits a bisection of size at least m/2+omega(sigma(n)(i=1) root d(i)). This extends a celebrated bound given by Shearer on Max-Cut of triangle-free graphs. In this paper, we establish a similar result by replacing C-6 with theta (1, 2, 4), theta (2, 3, 3) and theta (3, 3, 3), where theta(l(1), l(2), l(3)) denotes the graph consisting of three internally disjoint paths of length l(1), l(2) and l(3), respectively, each with the same endpoints. We also note that the bound is tight for certain polarity graphs. (C)& nbsp;2022 Elsevier B.V. All rights reserved.
Keyword ：
Bisection Bisection Cycle Cycle Degree Degree theta graph theta graph
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Rao, Mengjiao , Hou, Jianfeng , Zeng, Qinghou . Maximum bisections of graphs without cycles of length 4 [J]. | DISCRETE MATHEMATICS , 2022 , 345 (8) . |
| MLA | Rao, Mengjiao et al. "Maximum bisections of graphs without cycles of length 4" . | DISCRETE MATHEMATICS 345 . 8 (2022) . |
| APA | Rao, Mengjiao , Hou, Jianfeng , Zeng, Qinghou . Maximum bisections of graphs without cycles of length 4 . | DISCRETE MATHEMATICS , 2022 , 345 (8) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Given a graph G, let f(G) denote the maximum number of edges in a bipartite subgraph of G. Given a set .Ye of graphs and a positive integer m, let f (m, .Ye ) denote the minimum possible cardinality of f (G), as G ranges over all graphs on m edges that contains no member of .Ye as a subgraph. Suppose that r >= 10 is an even integer and k >= 2 is an integer. In this paper, we prove that there is a constant c(r) > 0 such that f (m, {C6, C7, ... , Cr & minus;1}) >= m/2 + c(r)mr/(r+1) and there is a constant c(k) > 0 such that f (m, {C4, C6, . . . , C2k, C2k+1}) >= m/2 + c(k)m(2k+2)/(2k+3), both of which improve a result of Alon, Bollob & aacute;s, Krivelevich and Sudakov. (c) 2021 Published by Elsevier B.V. Superscript/Subscript Available</comment
Keyword ：
Bipartite subgraph Bipartite subgraph Forbidden cycle Forbidden cycle Partition Partition
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Lin, Jing , Zeng, Qinghou . Maximum bipartite subgraphs in graphs without short cycles [J]. | DISCRETE APPLIED MATHEMATICS , 2022 , 311 : 18-25 . |
| MLA | Lin, Jing et al. "Maximum bipartite subgraphs in graphs without short cycles" . | DISCRETE APPLIED MATHEMATICS 311 (2022) : 18-25 . |
| APA | Lin, Jing , Zeng, Qinghou . Maximum bipartite subgraphs in graphs without short cycles . | DISCRETE APPLIED MATHEMATICS , 2022 , 311 , 18-25 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Suppose that G is a graph and H is a subgraph of G. We call H singular if the vertices of H either have the same degree in G or have pairwise distinct degrees in G. Let T-S(n, H) be the largest number of edges of a graph with n vertices that does not contain a singular copy of H. The problem of determining T-S(n, H) was studied initially by Caro and Tuza, who obtained an asymptotic bound for each H. In this paper, we consider the case that H is a star, and determine the exact values of T-S(n, K1,2) for all n, T-S(n, K1,4) and T-S(n, K-1,K-2s+1) for sufficiently large n.
Keyword ：
H-free H-free Singular Singular star star Turan number Turan number
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Sun, Gaoxing , Li, Heng , Zeng, Qinghou et al. Singular Turan numbers of stars [J]. | PURE AND APPLIED MATHEMATICS QUARTERLY , 2022 , 18 (6) : 2599-2618 . |
| MLA | Sun, Gaoxing et al. "Singular Turan numbers of stars" . | PURE AND APPLIED MATHEMATICS QUARTERLY 18 . 6 (2022) : 2599-2618 . |
| APA | Sun, Gaoxing , Li, Heng , Zeng, Qinghou , Hou, Jianfeng . Singular Turan numbers of stars . | PURE AND APPLIED MATHEMATICS QUARTERLY , 2022 , 18 (6) , 2599-2618 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Export
| Results： |
Selected to |
| Format： |
