A d-uniform hypergraph is a sum hypergraph iff there is a finite S ⊆ IN⁺ such that is isomorphic to the hypergraph ${⁺}_d\left(S\right)=(V,)$, where V = S and $=v₁,...,v_d:\left(i\ne j\Rightarrow v_i\ne v_j\right)\wedge {\sum }_{i=1}^d{v}_i\in S$. For an arbitrary d-uniform hypergraph the sum number σ = σ() is defined to be the minimum number of isolated vertices $w₁,...,w_{\sigma }\notin V$ such that $\cup w₁,...,w_{\sigma }$ is a sum hypergraph. In this paper, we prove $\sigma {(}_{n₁,...,n_d}^d)=1+{\sum }_{i=1}^d(n_i-1)+min0,\lceil 1/2({\sum }_{i=1}^{d-1}(n_i-1)-n_d)\rceil$, where ${}_{n₁,...,n_d}^d$ denotes the d-partite complete hypergraph; this generalizes the corresponding result of Hartsfield and Smyth [8] for complete bipartite graphs.

A hypergraph is a sum hypergraph iff there are a finite S ⊆ IN⁺ and d̲, [d̅] ∈ IN⁺ with 1 < d̲ ≤ [d̅] such that is isomorphic to the hypergraph ${}_{d̲,\left[d̅\right]}\left(S\right)=(V,)$ where V = S and $=e\subseteq S:d̲\le \left|e\right|\le \left[d̅\right]\wedge {\sum }_{v\in e}v\in S$. For an arbitrary hypergraph the sum number σ = σ() is defined to be the minimum number of isolated vertices $y₁,...,y_{\sigma }\notin V$ such that $\cup y₁,...,y_{\sigma }$ is a sum hypergraph. Generalizing the graph Cₙ we obtain d-uniform hypergraphs where any d consecutive vertices of Cₙ form an edge. We determine sum numbers and investigate properties of sum labellings...

A hypergraph ℋ is a sum hypergraph iff there are a finite S ⊆ ℕ⁺ and d̲,d̅ ∈ ℕ⁺ with 1 < d̲ < d̅ such that ℋ is isomorphic to the hypergraph ${\mathscr{H}}_{d̲,d̅}\left(S\right)=(V,)$ where V = S and $=e\subseteq S:d̲<\left|e\right|<d̅\wedge {\sum }_{v\in e}v\in S$. For an arbitrary hypergraph ℋ the sum number(ℋ ) is defined to be the minimum number of isolatedvertices $w₁,...,w_{\sigma }\notin V$ such that $\mathscr{H}\cup w₁,...,w_{\sigma }$ is a sum hypergraph. For graphs it is known that cycles Cₙ and wheels Wₙ have sum numbersgreater than one. Generalizing these graphs we prove for the hypergraphs ₙ and ₙ that under a certain condition...

Let $G$ be a weighted hypergraph with edges of size at most 2. Bollobás and Scott conjectured that $G$ admits a bipartition such that each vertex class meets edges of total weight at least $(w_1-{\Delta }_1)/2+2w_2/3$, where $w_i$ is the total weight of edges of size $i$ and ${\Delta }_1$ is the maximum weight of an edge of size 1. In this paper, for positive integer weighted hypergraph $G$ (i.e., multi-hypergraph), we show that there exists a bipartition of $G$ such that each vertex class meets edges of total weight at least $(w_0-1)/6+(w_1-{\Delta }_1)/3+2w_2/3$, where...

A topological space $X$ is said to be $e$-separable if $X$ has a $\sigma$-closed-discrete dense subset. Recently, G. Gruenhage and D. Lutzer showed that $e$-separable PIGO spaces are perfect and asked if $e$-separable monotonically normal spaces are perfect in general. The main purpose of this article is to provide examples of $e$-separable monotonically normal spaces which are not perfect. Extremely normal $e$-separable spaces are shown to be stratifiable.

We consider random dynamics on the edges of a uniform Cayley tree with $n$ vertices, in which edges are either flammable, fireproof, or burnt. Every flammable edge is replaced by a fireproof edge at unit rate, while fires start at smaller rate $n^{-\alpha }$ on each flammable edge, then propagate through the neighboring flammable edges and are only stopped at fireproof edges. A vertex is called fireproof when all its adjacent edges are fireproof. We show that as $n\to \infty$, the terminal density of fireproof...

We show that under the axiom $CP{A}_{cube}$ there is no uniformly completely Ramsey null set of size $2^{\omega }$. In particular, this holds in the iterated perfect set model. This answers a question of U. Darji.

Let $G$ be a simple graph, let $d\left(v\right)$ denote the degree of a vertex $v$ and let $g$ be a nonnegative integer function on $V\left(G\right)$ with $0\le g\left(v\right)\le d\left(v\right)$ for each vertex $v\in V\left(G\right)$. A $g_c$-coloring of $G$ is an edge coloring such that for each vertex $v\in V\left(G\right)$ and each color $c$, there are at least $g\left(v\right)$ edges colored $c$ incident with $v$. The $g_c$-chromatic index of $G$, denoted by ${\chi }_{g_c}^{\text{'}}\left(G\right)$, is the maximum number of colors such that a $g_c$-coloring of $G$ exists. Any simple graph $G$ has the $g_c$-chromatic index equal to ${\delta }_g\left(G\right)$ or ${\delta }_g\left(G\right)-1$, where ${\delta }_g\left(G\right)={min}_{v\in V\left(G\right)}\lfloor d\left(v\right)/g\left(v\right)\rfloor$. A graph $G$ is nearly bipartite,...

Let $G=\left(V\right(G),E(G\left)\right)$ be a simple graph and $E_G\left(v\right)$ denote the set of edges incident with a vertex $v$. A neighbor sum distinguishing (NSD) total coloring $\phi$ of $G$ is a proper total coloring of $G$ such that ${\sum }_{z\in E_G\left(u\right)\cup \left\{u\right\}}\phi \left(z\right)\ne {\sum }_{z\in E_G\left(v\right)\cup \left\{v\right\}}\phi \left(z\right)$ for each edge $uv\in E\left(G\right)$. Pilśniak and Woźniak asserted in 2015 that each graph with maximum degree $\Delta$ admits an NSD total $(\Delta +3)$-coloring. We prove that the list version of this conjecture holds for any IC-planar graph with $\Delta \ge 11$ but without $5$-cycles by applying the Combinatorial Nullstellensatz.

Let $G$ be a finite group. A normal subgroup $N$ of $G$ is a union of several $G$-conjugacy classes, and it is called $n$-decomposable in $G$ if it is a union of $n$ distinct $G$-conjugacy classes. In this paper, we first classify finite non-perfect groups satisfying the condition that the numbers of conjugacy classes contained in its non-trivial normal subgroups are two consecutive positive integers, and we later prove that there is no non-perfect group such that the numbers of conjugacy classes contained...

An even factor of a graph is a spanning subgraph in which each vertex has a positive even degree. Let $G$ be a bridgeless simple graph with minimum degree at least $3$. Jackson and Yoshimoto (2007) showed that $G$ has an even factor containing two arbitrary prescribed edges. They also proved that $G$ has an even factor in which each component has order at least four. Moreover, Xiong, Lu and Han (2009) showed that for each pair of edges $e_1$ and $e_2$ of $G$, there is an even factor containing $e_1$ and $e_2$...

A color-bounded hypergraph is a hypergraph (set system) with vertex set X and edge set = E₁,...,Eₘ, together with integers $s_i$ and $t_i$ satisfying $1\le s_i\le t_i\le \left|E_i\right|$ for each i = 1,...,m. A vertex coloring φ is proper if for every i, the number of colors occurring in edge $E_i$ satisfies $s_i\le \left|\phi \left(E_i\right)\right|\le t_i$. The hypergraph ℋ is colorable if it admits at least one proper coloring. We consider hypergraphs ℋ over a “host graph”, that means a graph G on the same vertex set X as ℋ, such that each $E_i$ induces a connected subgraph in G....

For a set D of positive integers, we define a vertex set S ⊆ V(G) to be D-independent if u, v ∈ S implies the distance d(u,v) ∉ D. The D-independence number ${\beta }_D\left(G\right)$ is the maximum cardinality of a D-independent set. In particular, the independence number $\beta \left(G\right)={\beta }_1\left(G\right)$. Along with general results we consider, in particular, the odd-independence number ${\beta }_{ODD}\left(G\right)$ where ODD = 1,3,5,....