期刊： SIAM JOURNAL ON DISCRETE MATHEMATICS, 2021; 35 (1)
Let B-n((k)) be the book graph which consists of n copies of Kk+1 all sharing a common Kk, and let Cm be a cycle of length m. In this paper, we first ......
期刊： SIAM JOURNAL ON DISCRETE MATHEMATICS, 2021; 35 (1)
The notion of goodness for Ramsey numbers was introduced by Burr and Erdos in 1983. For graphs G and H, let G + H be the graph obtained from disjoint ......
期刊： SIAM JOURNAL ON DISCRETE MATHEMATICS, 2021; 35 (1)
This paper studies the fundamental relations among integer flows, modulo orientations, integer-valued and real-valued circular flows, and monotonicity......
期刊： SIAM JOURNAL ON DISCRETE MATHEMATICS, 2021; 35 (2)
In this paper, we present a reciprocity on finite abelian groups involving zero-sum sequences. Let G and H be finite abelian groups with (vertical bar......
期刊： SIAM JOURNAL ON DISCRETE MATHEMATICS, 2021; 35 (2)
We prove that, for any integers k, l with k >= 3 and k/2 < l <= k-1, there exists a positive real mu such that, for all sufficiently large in......
期刊： SIAM JOURNAL ON DISCRETE MATHEMATICS, 2021; 35 (1)
For a given graph H, a graph G is H-linked if, for every injection phi : V (H) -> V (G), the graph G contains a subdivision of H with phi(v) corres......
期刊： SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020; 34 (2)
Answering a question of Haggkvist and Scott, Verstraete proved that every sufficiently large graph with average degree at least k(2) + 19k + 10 contai......
期刊： SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020; 34 (2)
We confirm a conjecture of Monical, Tokcan, and Yong on a characterization of the lattice points in the Newton polytopes of key polynomials.
期刊： SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020; 34 (2)
Let G be a graph with edge set E(G) and vertex set V(G), and let T be a vertex subset of G with even cardinality. A T-join of G is a subset J of edges......
期刊： SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020; 34 (1)
Given a graph H, the Turan number ex(n, H) is the largest number of edges in an H-free graph on n vertices. We make progress on a recent conjecture of......
期刊： SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020; 34 (1)
A graph G is (a : b)-colorable if there exists an assignment of b-element subsets of {1, ..., a} to vertices of G such that sets assigned to adjacent ......
期刊： SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020; 34 (1)
For integers a >= 2b > 0, a circular a/b-flow is a flow that takes values from {+b, +/-(b+ 1), ..., +/-(a - b)}. The Planar Circular Flow Conjec......
期刊： SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020; 34 (1)
A graph is H-free if it has no induced subgraph isomorphic to H. We characterize all graphs H for which there are only finitely many minimal non-3-col......
期刊： SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020; 34 (1)
The anti-Ramsey problem was introduced by Erdos, Simonovits, and Sos in 1970s. The anti-Ramsey number of a hypergraph H, ar(n, s, H), is the smallest ......
期刊： SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020; 34 (3)
A graph is said to be open-neighborhood conflict-free k-colorable if there exists an assignment of k different colors to some of the vertices such tha......
