Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Qinghou Zeng"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 44, Iss 4, p 1513 (2024)
Externí odkaz:
https://doaj.org/article/d0a6f8202a84472685cd9525e36ffd9a
Autor:
Jing Lin, Qinghou Zeng
Publikováno v:
Discrete Applied Mathematics. 311:18-25
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::354028ad7bac8cb4617b92f83a7964e9
https://doi.org/10.1016/j.dam.2021.12.031
https://doi.org/10.1016/j.dam.2021.12.031
Publikováno v:
Pure and Applied Mathematics Quarterly. 18:2599-2618
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe1be50bf28f8d5e26d04ba5f1c349de
https://doi.org/10.4310/pamq.2022.v18.n6.a12
https://doi.org/10.4310/pamq.2022.v18.n6.a12
Publikováno v:
Discrete Mathematics. 346:113344
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9618934da66d6ffde4afc152f4a8b47c
https://doi.org/10.1016/j.disc.2023.113344
https://doi.org/10.1016/j.disc.2023.113344
Publikováno v:
Graphs and Combinatorics. 38
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28fd2e6f74da2c30d6504b22b31f2896
https://doi.org/10.1007/s00373-022-02499-7
https://doi.org/10.1007/s00373-022-02499-7
Publikováno v:
Discrete Mathematics. 345:112914
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e4c235b27b64c17d45a539f41a8e5c91
https://doi.org/10.1016/j.disc.2022.112914
https://doi.org/10.1016/j.disc.2022.112914
Autor:
Chunlei Zu, Qinghou Zeng
In this paper, we consider the decomposition of multigraphs under minimum degree constraints and give a unified generalization of several results by various researchers. Let $G$ be a multigraph in which no quadrilaterals share edges with triangles an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::596960b63adfba5a76a953394b46c524
Publikováno v:
Bulletin of the Australian Mathematical Society. 100:13-26
For a graph $G$, let $f(G)$ denote the maximum number of edges in a bipartite subgraph of $G$. Given a fixed graph $H$ and a positive integer $m$, let $f(m,H)$ denote the minimum possible cardinality of $f(G)$, as $G$ ranges over all graphs on $m$ ed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8bd9cb1f7ec34558ebc7665dc06069e8
https://doi.org/10.1017/s0004972718001259
https://doi.org/10.1017/s0004972718001259
Publikováno v:
SIAM Journal on Discrete Mathematics. 32:505-521
Let $r\ge 3$ and $k\ge 2$ be fixed integers. Bollobas and Scott conjectured that every $r$-uniform hypergraph with $m$ edges has a vertex partition into $k$ sets with at most $m/k^r+o(m)$ edges in ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e6a0a6f82528dabacce461cef1b4029e
https://doi.org/10.1137/17m1128484
https://doi.org/10.1137/17m1128484
Autor:
Qinghou Zeng, Jianfeng Hou
Publikováno v:
Czechoslovak Mathematical Journal. 67:741-752
Let G be a weighted hypergraph with edges of size at most 2. Bollobas and Scott conjectured that G admits a bipartition such that each vertex class meets edges of total weight at least (w1−Δ1)/2+2w2/3, where wi is the total weight of edges of size
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c4a5e0581b42ca91a433e1d348068a4c
https://doi.org/10.21136/cmj.2017.0147-16
https://doi.org/10.21136/cmj.2017.0147-16