Home Avoiding rainbow 2-connected subgraphs
Article Open Access

Avoiding rainbow 2-connected subgraphs

  • Izolda Gorgol EMAIL logo
Published/Copyright: April 17, 2017

Abstract

While defining the anti-Ramsey number Erdős, Simonovits and Sós mentioned that the extremal colorings may not be unique. In the paper we discuss the uniqueness of the colorings, generalize the idea of their construction and show how to use it to construct the colorings of the edges of complete split graphs avoiding rainbow 2-connected subgraphs. These colorings give the lower bounds for adequate anti-Ramsey numbers.

MSC 2010: 05C55; 05C35

1 Introduction

A subgraph of an edge-colored graph is called rainbow if all of its edges have different colors. In 1973 Erdős, Simonovits and Sós [1] introduced the anti-Ramsey numbers as follows. For a graph H and a positive integer n, the anti-Ramsey number a r(Kn, H) is the maximum number of colors in an edge-coloring of Kn with no rainbow copy of H. The authors showed that these numbers are closely related to Turán numbers, especially for the cases when H is neither bipartite nor become bipartite after deleting a single edge. Among others, they constructed colorings avoiding rainbow cycles. They also mentioned that these colorings may not be unique.

Since then, numerous results have been established for a variety of graphs H. The paper of Fujita, Magnant and Ozeki [2] presents the survey of results of that type. Apart from that, the definition of anti-Ramsey number was widen by substituting the complete graph, to be colored, by some other graph, namely, for graphs G and H anti-Ramsey number a r(G, H) is the maximum number of colors in an edge-coloring of G with no rainbow copy of H. For instance, bipartite graphs [3, 4] or hypercubes [5] were considered as host graphs.

In the paper we formalize the construction of extremal colorings given in [1] and discuss their uniqueness. We use the concept to construct the colorings of complete split graphs which avoid rainbow 2-connected subgraphs. These colorings establish the lower bound for anti-Ramsey number a r(Kn + Ks¯ , H) for any 2-connected graph H.

Graphs considered below will always be simple, i.e. without loops and multiple edges. Throughout the paper we use the standard graph theory notation (see, e.g., [6]). V(G) and E(G) denote the vertex-set and the edge-set of a graph G, respectively. GH stands for disjoint sum of graphs G and H, pG denotes a graph consisting of p disjoint copies of a graph G and G¯ a complement of G. Kn, Cn denote, respectively, the complete graph and the cycle on n vertices. For a set S by |S| we denote the cardinality of S.

A join of graphs G and H is a graph F = G + H such that V(F) = V(G) ∪ V(H) and the edge-set E(F) = E(G) ∪ E(H) ∪ {vw : vV(G), wV(H)}. A complete split graph Kn + Ks¯ is a join of a complete graph Kn and an empty graph Ks¯ .

In other words a graph is a complete split graph if it can be partitioned in a clique Kn and an independent set Ks¯ in such a way that every vertex in the independent set is adjacent to every vertex in the clique.

2 ESS coloring

As we mentioned in [1] Erdős, Simonovits and Sós presented the edge-coloring of Kn avoiding rainbow cycles. This coloring is roughly described by the authors as follows. To avoid rainbow Ck we divide the vertices of Kn into nk1 of k−1 vertices. Then, we color all edges joining the vertices of the same group by different colors and edges joining the vertices from different groups by further nk1 colors in the following way: the vertices of the i-th group are joined by i-th extra color to the vertices of the j-th group if j > i.

Certainly, in a particular case, the appropriate floor and ceiling functions of nk1 should be used and one group with less than k−1 vertices can appear.

Remark 2.1

Note that the presented coloring also works if arbitrary rainbow 2-connected subgraph is forbidden.

The authors themselves mentioned that they do not focus on uniqueness of this coloring and conjectured that this construction uses maximum possible number of colors. The conjecture was proved by them for a triangle, for a 4-cycle by Alon [7], for k = 5, 6 Jiang and West [8] and finally completely confirmed by Montellano-Ballesteros and Neuman-Lara [9].

We try to generalize and formalize this very intuitive construction of Erdős, Simonovits and Sós.

Definition 2.2

Let G be a connected graph and let V(G)=i=1tVi be a partition of the vertex set of G, such that each Ci = G[Vi] is connected and for each i = 1, 2…, t−1 there exists at least one edge between Ci and Cj, for certain j ∊ {i+1, …, t}. We color the edges inside Ci rainbowly and among the components in a following way. All edges vivj with viVi, vjVj, 1≤ i < jt obtain i-th extra color. We say that we use ESS coloring to the partition into components (C1, C2, …, Ct).

In case of components isomorphic to C in the sequence we will write (…, pC,…) instead of (,C,C,,Cp,).

Remark 2.3

Note that in the original coloring of Erdős, Simonovits and Sós the components were cliques on k−1 vertices and maybe one clique with less vertices and all edges among components were present.

Remark 2.4

Note that we use i=1t|E(Ci)|+(t1) colors in ESS coloring.

Remark 2.5

Note that the ESS coloring avoids 2-connected rainbow subgraphs of order greater then maxi |Vi|.

Therefore, the idea of constructing these colorings is to choose components with equal number of vertices one less than the order of the forbidden graph H. To maximize the number of colors they should contain as many edges as possible, which means that they should be as close to complete graph as possible. One can imagine other reasons for avoiding rainbow H than only the number of vertices. In this light coloring constructions presented by Axenovich et. al. in [4] avoiding rainbow even cycles in bipartite graphs can be seen as ESS colorings. The authors proposed the partition of Km,n into (Kk−1, n−(k−1), Km−(k−1),k−1) or ((mk+1)K1, Kk−1,n). In that way they avoid rainbow C2k and the reason is too few vertices in one of bipartition parts.

Further we discuss the uniqueness of the coloring. We do not give the formal definition of isomorphism of colorings. We simply understand that the colorings c1 and c2 are the same if there exists the permutation of colors π such that π(c1) = c2.

Remark 2.6

Although Erdős et. al. do not focus on uniqueness of colorings, they give accidentally two different colorings avoiding rainbow triangles. One is the special case of their intuitive construction for k = 3. It means that the components in ESS coloring are independent edges and possible one single vertex. The coloring uses n2+n21=n1 colors. On the other hand, in the proof of the theorem for triangles the authors present another coloring where components are simply vertices of Kn. Actually all “between coloring” are suitable in that case.

Proposition 2.7

There are at least n2 different colorings of Kn with n−1 colors avoiding the rainbow triangle.

Proof

Each partition (pK2, (n−2p)K1), p = 0, …, n2 − 1 together with ESS coloring is a coloring with n − 1 colors without rainbow triangle.     □

It is worth noticing that we end with parameter p = n2 − 1, because partitions ( n2 K2, K1) and (( n2 − 1)K2, 3K1) generate the same colorings.

Apart from that, not all colorings are characterized by the above partition. For instance, for n = 5 coloring induced by (2K2, K1) partition is different than that induced by (K1, 2K2). The latter appears to be different from all of the type (pK2, (5−2p)K1), p = 0, 1. On the other hand, not all possible partitions give different colorings. For instance colorings induced by the partitions (5K1) and (3K1, K2) are the same. In the Figure 1 colorings induced by all possible partitions of vertices of K5 into components K2 and K1 are presented. In the first row there are colorings from Proposition 2.7 for p = 0, 1. In the remaining rows there are colorings induced by all other possible partitions. Colorings in the first and the second columns are the same. Second row contains all different colorings of K5 without rainbow triangle.

Figure 1 
4-colorings of edges of K5 without rainbow K3
Figure 1

4-colorings of edges of K5 without rainbow K3

Observe that this diversity of colorings without rainbow triangles comes from the fact that the color of the only edge in the component K2 can be sometimes exchanged into one color among two components, which arise by replacing this component by two components K1. It means that in that case we can substitute “main” component Kk−1 = K2 by two “reminder” components K1. While avoiding C4, for example, we cannot change the order of “main” components, which are K3, in extremal colorings. Nevertheless, different colorings can be constructed by placing the remaining component Kr, with r = n mod 3, r ≠ 0, in the different positions in the sequence of components. Apart from that, for r = 2 we can again sometimes substitute K2 by 2K1 to generate new coloring.

Therefore, it is a challenge to characterize all extremal colorings, but undoubtely worth considering. It seems to be as complicated as characterization of Túran extremal graphs or Ramsey extremal graphs.

3 Application of ESS colorings to complete split graphs

In this section we show how to apply the ESS coloring to construct colorings of complete split graphs avoiding rainbow 2-connected subgraph H. As a result we obtain the lower bounds for anti-Ramsey number a r(Kn + Ks¯ , H) depending on n, s and k = |V(H)|. As we always refer to ESS colorings in the proofs, we only indicate a procedure of creating a sequence of components. As we know (see Remark 2.1), the ESS coloring avoids 2-connected subgraph.

We start with the graphs which are large in comparison to a complete part of the split graph.

Theorem 3.1

Let n ≥ 2, s ≥ 1, k ≥ 3 and n + sk. Let H be an arbitrary 2-connected graph on kn + 1 vertices. Then there exists an edge-coloring of Kn+Ks¯withn2+(n1)(k1n)+s colors avoiding rainbow H.

Proof

The sequence of components is as follows: firstly we take s−(k − 1 − n)K1 from the empty part and the last component is the remaining complete split graph. Kn+Kk1n¯. Certainly we use (n2) + n(k − 1 − n)+s − (k − 1 − n) = (n2) +(n − 1)(k − 1 − n)+s colors.     □

We obtain a straightforward corollary.

Corollary 3.2

Let n ≥ 2, s ≥ 1, k ≥ 3 and n+sk. Let H be an arbitrary 2-connected graph on kn+1 vertices. Then a r (Kn+Ks¯,H)(n2)+(n1)(k1n)+s.

Now we focus on the cases when the order of the graph H is comparable with the order of a complete part of the split graph.

Theorem 3.3

Let n ≥ 2, k ≥ 3, snk2,r=(n+s)n+sk1(k1) and n+sk. Let H be an arbitrary 2-connected graph on kn vertices. Then there exists an edge-coloring of K n + K s ¯ w i t h n + s k 1 ( k 1 2 ) + r 2 + n + s k 1 1 colors avoiding rainbow H.

Proof

The sequence of components is as follows. Firstly, we take sKk−2 contained in a complete part Kn. To each clique Kk−2 we add exactly one vertex from the empty part Ks¯ . In such a way we obtain s components Kk−1. Then we divide the remaining vertices of a complete part into cliques Kk−1 making next components being Kk−1. We may obtain a certain remainder clique Kr as the last component. Note that this procedure is equivalent to division the whole vertex-set of the graph Kn + Ks¯ into cliques of order k−1 in such a way that each clique contains at most one vertex from the empty part. It is possible since s nk2. Altogether we use n+sk1(k12)+r2+n+sk11 colors.     □

Corollary 3.4

Let n ≥ 2, k ≥3, snk2,r=(n+s)n+sk1(k1) and n+sk. Let H be an arbitrary 2-connected graph on kn vertices. Then a r (Kn+Ks¯,H)n+sk1(k12)+r2+n+sk11.

Theorem 3.5

Let n ≥ 2, k ≥ 3, nk2=nk2,s>nk2 and n + sk. Let H be an arbitrary 2-connected graph on kn vertices. Then there exists an edge-coloring of Kn+Ks¯withnk2(k12)+s1 colors avoiding rainbow H.

Proof

The sequence of components is as follows. Firstly, we take s nk2 components K1 from the empty part. Then we take nk2 Kk−2 contained in a complete part Kn. To each clique Kk−2 we add exactly one vertex from the empty part Ks¯ . In such a way we add nk2 Kk−1 to the sequence of components. Altogether we use nk2(k12)+nk21+snk2=nk2(k12)+s1 colors.     □

Corollary 3.6

Let n ≥ 2, k ≥ 3, nk2=nk2,s>nk2 and n+sk. Let H be an arbitrary 2-connected graph on kn vertices. Then a r (Kn+Ks¯,H)nk2(k12)+s1.

Theorem 3.7

Let n ≥ 2, k ≥ 3, nk2<nk2,r=nnk2(k2),nk2snk2+kr1 and n + sk. Let H be an arbitrary 2-connected graph on kn vertices. Then there exists an edge-coloring of Kn + Ks¯withnk2(k12)+r2+r(snk2)+nk21 colors avoiding rainbow H.

Proof

The sequence of components is as follows. Firstly, we take nk2 Kk−2 contained in a complete part Kn, to each clique Kk−2 we add exactly one vertex from the empty part Ks¯ . In such a way we obtain nk2 components Kk−1. Then we form a complete split graph from remainining vertices as the last component. Altogether we use nk2(k12)+r2+r(snk2)+nk21 colors.     □

Corollary 3.8

Let n ≥ 2, k ≥ 3, nk2<nk2,r=nnk2(k2),nk2snk2+kr1 and n + sk. Let H be an arbitrary 2-connected graph on kn vertices. Then a r (Kn+Ks¯,H)nk2(k12)+r2+r(snk2)+nk21.

Theorem 3.9

Let n ≥ 2, k ≥ 3, nk2<nk2,r=nnk2(k2),s>nk2+kr1 and n+sk. Let H be an arbitrary 2-connected graph on kn vertices. Then there exists an edge-coloring of Kn + Ks¯ with nk2(k12)+r2+(r1)(k1r)+s colors avoiding rainbow H.

Proof

We color the edges of Kn + Ks¯ as follows. Firstly, we take (s(nk2+k1r)) K1 out of the empty part, then nk2 Kk−2 contained in a complete part Kn, to each clique Kk−2 we add exactly one vertex from the empty part Ks¯ . In such a way we obtain next nk2 components Kk−1 in the sequence. Finally, we take a complete split graph Kr+Kk1r¯ as the last component. Altogether we use nk2(k12)+r2+r(k1r)+s(nk2+k1r)+nk21=nk2(k12)+r2+(r1)(k1r)+s colors.     □

Corollary 3.10

Let n ≥ 2, k ≥ 3, nk2<nk2,r=nnk2(k2),s>nk2+kr1 and n+sk. Let H be an arbitrary 2-connected graph on kn vertices. Then a r (Kn+Ks¯,H)nk2(k12)+r2 + (r−1)(k−1−r)+s.

3.1 Optimality and uniqueness

It is difficult to claim that the colorings presented in the previous section are always optimal (looking at the number of colors used). While constructing these colorings, we pay attention only to the order of the 2-connected graph H and the fact that it is bridge-free. So it is quite possible that for a particular graph H a better coloring can be constructed looking at its structure. Nevertheless, there are cases that the constructions are best possible in that sense.

Consider the simplest 2-connected graph H = K3. For this graph we have k = 3 so by Theorems 3.3 and 3.5 we obtain the existence of the edge-coloring of Kn + Ks¯ avoiding rainbow triangle with n + s − 1 colors. It is shown [10] that a r(Kn + Ks¯ , K3) = n+s−1. It means that the coloring presented in Theorems 3.3 and 3.5 use maximal possible number of colors. Note that these colorings use maximum matchings and possible single vertices as components and EES coloring. Similarly, as in the case of the complete graph considered as the host graph, changing the position of the componet K1 (if any), or replacing K2 by 2K1 we can obtain other colorings with n+s−1 colors avoiding rainbow K3. In other cases we can also create families of different colorings which avoid rainbow 2-connected subgraph. It is interesting if all of these colorings can be described using ESS colorings or maybe other constructions can appear. Another thing is to establish for which graphs presented colorings are optimal in the sense of number of colors used, i.e. which lower bounds for anti-Ramsey numbers are sharp.

References

[1] Erdős P., Simonovits A., Sós V., Anti–Ramsey theorems, In: (A. Hajnal, R. Rado, and V.Sós, eds.) Infinite and finite sets (Colloq. Math. Soc. J. Bolyai, North-Holland, 1973), 633–643Search in Google Scholar

[2] Fujita S., Magnant C., Ozeki K., Rainbow Generalizations of Ramsey Theory: A Dynamic Survey, Theory and Applications of Graphs, firstly in Graphs and Combinatorics 26 (2010), 1–3010.20429/tag.2014.000101Search in Google Scholar

[3] Axenovich M., Jiang T., Anti-Ramsey numbers for small complete bipartite graphs, Ars Combinatoria 73 (2004), 311–318Search in Google Scholar

[4] Axenovich M., Jiang T., Kündgen A., Bipartite anti-Ramsey numbers of cycles, J. Graph Theory 47 (2004), 9–2810.1002/jgt.20012Search in Google Scholar

[5] Axenovich M., Harborth H., Kemnitz A., Möller M., Schiermeyer I., Rainbows in the Hypercube, Graphs and Combinatorics 23 (2007), 123–13310.1007/s00373-007-0691-6Search in Google Scholar

[6] Diestel R., Graph theory (Springer-Verlag, New York, 1997)Search in Google Scholar

[7] Alon N., On the conjecture of Erdős, Simonovits and Sós concerning anti-Ramsey theorems, J. Graph Theory 7 (1983), 91–9410.1002/jgt.3190070112Search in Google Scholar

[8] Jiang T., West D.B., On the Erdős-Simonovits-Sós conjecture about the anti-Ramsey number of a cycle, Combin. Probab. Comput. 12 (2003), 585–59810.1017/S096354830300590XSearch in Google Scholar

[9] Montellano-Ballesteros J.J., Neuman-Lara V., An anti-Ramsey theorem on cycles, Graphs and Combinatorics 21 (2005), 343–35410.1007/s00373-005-0619-ySearch in Google Scholar

[10] Gorgol I., Anti-Ramsey numbers in complete split graphs, Discrete Mathematics 339(7), (2016), 1944–194910.1016/j.disc.2015.10.038Search in Google Scholar

Received: 2015-10-26
Accepted: 2016-2-19
Published Online: 2017-4-17

© 2017 Gorgol

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Articles in the same Issue

  1. Regular Articles
  2. Integrals of Frullani type and the method of brackets
  3. Regular Articles
  4. Edge of chaos in reaction diffusion CNN model
  5. Regular Articles
  6. Calculus using proximities: a mathematical approach in which students can actually prove theorems
  7. Regular Articles
  8. An investigation on hyper S-posets over ordered semihypergroups
  9. Regular Articles
  10. The Leibniz algebras whose subalgebras are ideals
  11. Regular Articles
  12. Fixed point and multidimensional fixed point theorems with applications to nonlinear matrix equations in terms of weak altering distance functions
  13. Regular Articles
  14. Matrix rank and inertia formulas in the analysis of general linear models
  15. Regular Articles
  16. The hybrid power mean of quartic Gauss sums and Kloosterman sums
  17. Regular Articles
  18. Tauberian theorems for statistically (C,1,1) summable double sequences of fuzzy numbers
  19. Regular Articles
  20. Some properties of graded comultiplication modules
  21. Regular Articles
  22. The characterizations of upper approximation operators based on special coverings
  23. Regular Articles
  24. Bi-integrable and tri-integrable couplings of a soliton hierarchy associated with SO(4)
  25. Regular Articles
  26. Dynamics for a discrete competition and cooperation model of two enterprises with multiple delays and feedback controls
  27. Regular Articles
  28. A new view of relationship between atomic posets and complete (algebraic) lattices
  29. Regular Articles
  30. A class of extensions of Restricted (s, t)-Wythoff’s game
  31. Regular Articles
  32. New bounds for the minimum eigenvalue of 𝓜-tensors
  33. Regular Articles
  34. Shintani and Shimura lifts of cusp forms on certain arithmetic groups and their applications
  35. Regular Articles
  36. Empirical likelihood for quantile regression models with response data missing at random
  37. Regular Articles
  38. Convex combination of analytic functions
  39. Regular Articles
  40. On the Yang-Baxter-like matrix equation for rank-two matrices
  41. Regular Articles
  42. Uniform topology on EQ-algebras
  43. Regular Articles
  44. Integrations on rings
  45. Regular Articles
  46. The quasilinear parabolic kirchhoff equation
  47. Regular Articles
  48. Avoiding rainbow 2-connected subgraphs
  49. Regular Articles
  50. On non-Hopfian groups of fractions
  51. Regular Articles
  52. Singularly perturbed hyperbolic problems on metric graphs: asymptotics of solutions
  53. Regular Articles
  54. Rings in which elements are the sum of a nilpotent and a root of a fixed polynomial that commute
  55. Regular Articles
  56. Superstability of functional equations related to spherical functions
  57. Regular Articles
  58. Evaluation of the convolution sum involving the sum of divisors function for 22, 44 and 52
  59. Regular Articles
  60. Weighted minimal translation surfaces in the Galilean space with density
  61. Regular Articles
  62. Complete convergence for weighted sums of pairwise independent random variables
  63. Regular Articles
  64. Binomials transformation formulae for scaled Fibonacci numbers
  65. Regular Articles
  66. Growth functions for some uniformly amenable groups
  67. Regular Articles
  68. Hopf bifurcations in a three-species food chain system with multiple delays
  69. Regular Articles
  70. Oscillation and nonoscillation of half-linear Euler type differential equations with different periodic coefficients
  71. Regular Articles
  72. Osculating curves in 4-dimensional semi-Euclidean space with index 2
  73. Regular Articles
  74. Some new facts about group 𝒢 generated by the family of convergent permutations
  75. Regular Articles
  76. lnfinitely many solutions for fractional Schrödinger equations with perturbation via variational methods
  77. Regular Articles
  78. Supersolvable orders and inductively free arrangements
  79. Regular Articles
  80. Asymptotically almost automorphic solutions of differential equations with piecewise constant argument
  81. Regular Articles
  82. Finite groups whose all second maximal subgroups are cyclic
  83. Regular Articles
  84. Semilinear systems with a multi-valued nonlinear term
  85. Regular Articles
  86. Positive solutions for Hadamard differential systems with fractional integral conditions on an unbounded domain
  87. Regular Articles
  88. Calibration and simulation of Heston model
  89. Regular Articles
  90. One kind sixth power mean of the three-term exponential sums
  91. Regular Articles
  92. Cyclic pairs and common best proximity points in uniformly convex Banach spaces
  93. Regular Articles
  94. The uniqueness of meromorphic functions in k-punctured complex plane
  95. Regular Articles
  96. Normalizers of intermediate congruence subgroups of the Hecke subgroups
  97. Regular Articles
  98. The hyperbolicity constant of infinite circulant graphs
  99. Regular Articles
  100. Scott convergence and fuzzy Scott topology on L-posets
  101. Regular Articles
  102. One sided strong laws for random variables with infinite mean
  103. Regular Articles
  104. The join of split graphs whose completely regular endomorphisms form a monoid
  105. Regular Articles
  106. A new branch and bound algorithm for minimax ratios problems
  107. Regular Articles
  108. Upper bound estimate of incomplete Cochrane sum
  109. Regular Articles
  110. Value distributions of solutions to complex linear differential equations in angular domains
  111. Regular Articles
  112. The nonlinear diffusion equation of the ideal barotropic gas through a porous medium
  113. Regular Articles
  114. The Sheffer stroke operation reducts of basic algebras
  115. Regular Articles
  116. Extensions and improvements of Sherman’s and related inequalities for n-convex functions
  117. Regular Articles
  118. Classification lattices are geometric for complete atomistic lattices
  119. Regular Articles
  120. Possible numbers of x’s in an {x, y}-matrix with a given rank
  121. Regular Articles
  122. New error bounds for linear complementarity problems of weakly chained diagonally dominant B-matrices
  123. Regular Articles
  124. Boundedness of vector-valued B-singular integral operators in Lebesgue spaces
  125. Regular Articles
  126. On the Golomb’s conjecture and Lehmer’s numbers
  127. Regular Articles
  128. Some applications of the Archimedean copulas in the proof of the almost sure central limit theorem for ordinary maxima
  129. Regular Articles
  130. Dual-stage adaptive finite-time modified function projective multi-lag combined synchronization for multiple uncertain chaotic systems
  131. Regular Articles
  132. Corrigendum to: Dual-stage adaptive finite-time modified function projective multi-lag combined synchronization for multiple uncertain chaotic systems
  133. Regular Articles
  134. Convergence and stability of generalized φ-weak contraction mapping in CAT(0) spaces
  135. Regular Articles
  136. Triple solutions for a Dirichlet boundary value problem involving a perturbed discrete p(k)-Laplacian operator
  137. Regular Articles
  138. OD-characterization of alternating groups Ap+d
  139. Regular Articles
  140. On Jordan mappings of inverse semirings
  141. Regular Articles
  142. On generalized Ehresmann semigroups
  143. Regular Articles
  144. On topological properties of spaces obtained by the double band matrix
  145. Regular Articles
  146. Representing derivatives of Chebyshev polynomials by Chebyshev polynomials and related questions
  147. Regular Articles
  148. Chain conditions on composite Hurwitz series rings
  149. Regular Articles
  150. Coloring subgraphs with restricted amounts of hues
  151. Regular Articles
  152. An extension of the method of brackets. Part 1
  153. Regular Articles
  154. Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
  155. Regular Articles
  156. Strong edge geodetic problem in networks
  157. Regular Articles
  158. Ricci solitons on almost Kenmotsu 3-manifolds
  159. Regular Articles
  160. Uniqueness of meromorphic functions sharing two finite sets
  161. Regular Articles
  162. On the fourth-order linear recurrence formula related to classical Gauss sums
  163. Regular Articles
  164. Dynamical behavior for a stochastic two-species competitive model
  165. Regular Articles
  166. Two new eigenvalue localization sets for tensors and theirs applications
  167. Regular Articles
  168. κ-strong sequences and the existence of generalized independent families
  169. Regular Articles
  170. Commutators of Littlewood-Paley gκ -functions on non-homogeneous metric measure spaces
  171. Regular Articles
  172. On decompositions of estimators under a general linear model with partial parameter restrictions
  173. Regular Articles
  174. Groups and monoids of Pythagorean triples connected to conics
  175. Regular Articles
  176. Hom-Lie superalgebra structures on exceptional simple Lie superalgebras of vector fields
  177. Regular Articles
  178. Numerical methods for the multiplicative partial differential equations
  179. Regular Articles
  180. Solvable Leibniz algebras with NFn Fm1 nilradical
  181. Regular Articles
  182. Evaluation of the convolution sums ∑al+bm=n lσ(l) σ(m) with ab ≤ 9
  183. Regular Articles
  184. A study on soft rough semigroups and corresponding decision making applications
  185. Regular Articles
  186. Some new inequalities of Hermite-Hadamard type for s-convex functions with applications
  187. Regular Articles
  188. Deficiency of forests
  189. Regular Articles
  190. Perfect codes in power graphs of finite groups
  191. Regular Articles
  192. A new compact finite difference quasilinearization method for nonlinear evolution partial differential equations
  193. Regular Articles
  194. Does any convex quadrilateral have circumscribed ellipses?
  195. Regular Articles
  196. The dynamic of a Lie group endomorphism
  197. Regular Articles
  198. On pairs of equations in unlike powers of primes and powers of 2
  199. Regular Articles
  200. Differential subordination and convexity criteria of integral operators
  201. Regular Articles
  202. Quantitative relations between short intervals and exceptional sets of cubic Waring-Goldbach problem
  203. Regular Articles
  204. On θ-commutators and the corresponding non-commuting graphs
  205. Regular Articles
  206. Quasi-maximum likelihood estimator of Laplace (1, 1) for GARCH models
  207. Regular Articles
  208. Multiple and sign-changing solutions for discrete Robin boundary value problem with parameter dependence
  209. Regular Articles
  210. Fundamental relation on m-idempotent hyperrings
  211. Regular Articles
  212. A novel recursive method to reconstruct multivariate functions on the unit cube
  213. Regular Articles
  214. Nabla inequalities and permanence for a logistic integrodifferential equation on time scales
  215. Regular Articles
  216. Enumeration of spanning trees in the sequence of Dürer graphs
  217. Regular Articles
  218. Quotient of information matrices in comparison of linear experiments for quadratic estimation
  219. Regular Articles
  220. Fourier series of functions involving higher-order ordered Bell polynomials
  221. Regular Articles
  222. Simple modules over Auslander regular rings
  223. Regular Articles
  224. Weighted multilinear p-adic Hardy operators and commutators
  225. Regular Articles
  226. Guaranteed cost finite-time control of positive switched nonlinear systems with D-perturbation
  227. Regular Articles
  228. A modified quasi-boundary value method for an abstract ill-posed biparabolic problem
  229. Regular Articles
  230. Extended Riemann-Liouville type fractional derivative operator with applications
  231. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  232. The algebraic size of the family of injective operators
  233. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  234. The history of a general criterium on spaceability
  235. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  236. On sequences not enjoying Schur’s property
  237. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  238. A hierarchy in the family of real surjective functions
  239. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  240. Dynamics of multivalued linear operators
  241. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  242. Linear dynamics of semigroups generated by differential operators
  243. Special Issue on Recent Developments in Differential Equations
  244. Isomorphism theorems for some parabolic initial-boundary value problems in Hörmander spaces
  245. Special Issue on Recent Developments in Differential Equations
  246. Determination of a diffusion coefficient in a quasilinear parabolic equation
  247. Special Issue on Recent Developments in Differential Equations
  248. Homogeneous two-point problem for PDE of the second order in time variable and infinite order in spatial variables
  249. Special Issue on Recent Developments in Differential Equations
  250. A nonlinear plate control without linearization
  251. Special Issue on Recent Developments in Differential Equations
  252. Reduction of a Schwartz-type boundary value problem for biharmonic monogenic functions to Fredholm integral equations
  253. Special Issue on Recent Developments in Differential Equations
  254. Inverse problem for a physiologically structured population model with variable-effort harvesting
  255. Special Issue on Recent Developments in Differential Equations
  256. Existence of solutions for delay evolution equations with nonlocal conditions
  257. Special Issue on Recent Developments in Differential Equations
  258. Comments on behaviour of solutions of elliptic quasi-linear problems in a neighbourhood of boundary singularities
  259. Special Issue on Recent Developments in Differential Equations
  260. Coupled fixed point theorems in complete metric spaces endowed with a directed graph and application
  261. Special Issue on Recent Developments in Differential Equations
  262. Existence of entropy solutions for nonlinear elliptic degenerate anisotropic equations
  263. Special Issue on Recent Developments in Differential Equations
  264. Integro-differential systems with variable exponents of nonlinearity
  265. Special Issue on Recent Developments in Differential Equations
  266. Elliptic operators on refined Sobolev scales on vector bundles
  267. Special Issue on Recent Developments in Differential Equations
  268. Multiplicity solutions of a class fractional Schrödinger equations
  269. Special Issue on Recent Developments in Differential Equations
  270. Determining of right-hand side of higher order ultraparabolic equation
  271. Special Issue on Recent Developments in Differential Equations
  272. Asymptotic approximation for the solution to a semi-linear elliptic problem in a thin aneurysm-type domain
  273. Topical Issue on Metaheuristics - Methods and Applications
  274. Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs
  275. Topical Issue on Metaheuristics - Methods and Applications
  276. Nature–inspired metaheuristic algorithms to find near–OGR sequences for WDM channel allocation and their performance comparison
  277. Topical Issue on Cyber-security Mathematics
  278. Monomial codes seen as invariant subspaces
  279. Topical Issue on Cyber-security Mathematics
  280. Expert knowledge and data analysis for detecting advanced persistent threats
  281. Topical Issue on Cyber-security Mathematics
  282. Feedback equivalence of convolutional codes over finite rings
Downloaded on 10.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/math-2017-0035/html
Scroll to top button