150 research outputs found
Size and structure of large -union intersecting families
A family \F of sets is said to be intersecting if any two sets in \F have
nonempty intersection. The celebrated Erd{\H o}s-Ko-Rado theorem determines the
size and structure of the largest intersecting family of -sets on an -set
. An -union intersecting family is a family of -sets on an -set
such that for any in this family,
Let \ell(\F) be the minimum number of sets in \F such that by
removing them the resulting subfamily is intersecting. In this paper, for
sufficiently large , we characterize the size and structure of -union
intersecting families with maximum possible size and \ell(\F)\geq s+\beta.
This allows us to find out the size and structure of some large and maximal
-union intersecting families.
Our results are nontrivial extensions of some recent generalizations of the
Erd{\H o}s-Ko-Rado theorem such as the Han and Kohayakawa theorem 2017 which
finds the structure of the third largest intersecting family, the Kostochka and
Mubayi theorem 2017, and the more recent Kupavskii's theorem 2018 whose both
results determine the size and structure of the th largest intersecting
family of -sets for . In particular, we prove that a
Hilton-Milner-type stability theorem holds for -union intersecting
families, that indeed, confirms a conjecture of Alishahi and Taherkhani 2018.
We extend our results to -free subgraphs of Kneser
graphs. In fact, when is sufficiently large, we characterize the size and
structure of large and maximal -free subgraphs of
Kneser graphs. In particular, when our result provides
some stability results related to the famous Erd{\H o}s matching conjecture
r-Dynamic Chromatic Number of Graphs
An -dynamic -coloring of a graph is a proper vertex -coloring
such that the neighbors of any vertex receive at least different colors. The -dynamic chromatic number of ,
, is defined as the smallest such that admits an -dynamic
-coloring. In this paper we introduce an upper bound for in
terms of , chromatic number, maximum degree and minimum degree. In 2001,
Montgomery \cite{MR2702379} conjectured that, for a -regular graph ,
. In this regard, for a -regular graph , we
present two upper bounds for , one of them, , is an improvement of the bound ,
proved by Alishahi (2011) \cite{MR2746973}. Also, we give an upper bound for
in terms of chromatic number, maximum degree and minimum degree.Comment: 9 page
On Coloring Properties of Graph Powers
This paper studies some coloring properties of graph powers. We show that
provided that . As a consequence, one can
see that if , then
.
In particular, and
has no subgraph with circular chromatic number equal to
. This provides a negative answer to a question asked in
[Xuding Zhu, Circular chromatic number: a survey, Discrete Math.,
229(1-3):371--410, 2001]. Also, we present an upper bound for the fractional
chromatic number of subdivision graphs. Precisely, we show that
.
Finally, we investigate the th multichromatic number of subdivision graphs
A Note on Chromatic Sum
The chromatic sum of a graph is the smallest sum of colors
among of proper coloring with the natural number. In this paper, we introduce a
necessary condition for the existence of graph homomorphisms. Also, we present
for every graph
Extremal -free induced subgraphs of Kneser graphs
The Kneser graph is a graph whose vertex set is the family
of all -subsets of and two vertices are adjacent if their
corresponding subsets are disjoint. The classical Erd\H{o}s-Ko-Rado theorem
determines the cardinality and structure of a maximum induced -free
subgraph in . As a generalization of the Erd\H{o}s-Ko-Rado
theorem, Erd\H{o}s proposed a conjecture about the maximum order of an induced
-free subgraph of . As the best known result
concerning this conjecture, Frankl [Journal of Combinatorial Theory, Series A,
2013], when , gave an affirmative answer to this conjecture and
also determined the structure of such a subgraph. In this paper, generalizing
the Erd\H{o}s-Ko-Rado theorem and the Erd{\H o}s matching conjecture, we
consider the problem of determining the structure of a maximum family
for which has no subgraph
isomorphic to a given graph . In this regard, we determine the size and the
structure of such a family provided that is sufficiently large with respect
to and . Furthermore, for the case , we present a
Hilton-Milner type theorem regarding above-mentioned problem, which specializes
to an improvement of a result by Gerbner et al. [SIAM Journal on Discrete
Mathematics, 2012].Comment: Minor change
Coloring Properties of Categorical Product of General Kneser Hypergraphs
More than 50 years ago Hedetniemi conjectured that the chromatic number of
categorical product of two graphs is equal to the minimum of their chromatic
numbers. This conjecture has received a considerable attention in recent years.
Hedetniemi's conjecture were generalized to hypergraphs by Zhu in 1992.
Hajiabolhassan and Meunier (2016) introduced the first nontrivial lower bound
for the chromatic number of categorical product of general Kneser hypergraphs
and using this lower bound, they verified Zhu's conjecture for some families of
hypergraphs. In this paper, we shall present some colorful type results for the
coloring of categorical product of general Kneser hypergraphs, which generalize
the Hajiabolhassan-Meunier result. Also, we present a new lower bound for the
chromatic number of categorical product of general Kneser hypergraphs which can
be extremely better than the Hajiabolhassan-Meunier lower bound. Using this
lower bound, we enrich the family of hypergraphs satisfying Zhu's conjecture
On the random version of the Erd\H{o}s matching conjecture
The Kneser hypergraph is an -uniform hypergraph with
vertex set consisting of all -subsets of and any collection
of vertices forms an edge if their corresponding -sets are pairwise
disjoint. The random Kneser hypergraph is a spanning
subhypergraph of in which each edge of is
retained independently of each other with probability . The independence
number of random subgraphs of was recently addressed in a
series of works by Bollob{\'a}s, Narayanan, and Raigorodskii (2016), Balogh,
Bollob{\'a}s, and Narayanan (2015), Das and Tran (2016), and Devlin and Kahn
(2016). It was proved that the random counterpart of the Erd\H{o}s-Ko-Rado
theorem continues to be valid even for very small values of . In this paper,
generalizing this result, we will investigate the independence number of random
Kneser hypergraphs . Broadly speaking, when is much
smaller that , we will prove that the random analogue of the Erd\H{o}s
matching conjecture is true even for extremely small values of .Comment: 11 page
A Catlin-type Theorem for Graph Partitioning Avoiding Prescribed Subgraphs
As an extension of the Brooks theorem, Catlin in 1979 showed that if is
neither an odd cycle nor a complete graph with maximum degree , then
has a vertex -coloring such that one of the color classes is a
maximum independent set. Let be a connected graph of order at least . A
-free -coloring of a graph is a partition of the vertex set of
into such that , the subgraph induced on , does
not contain any subgraph isomorphic to . As a generalization of Catlin's
theorem we show that a graph has a -free -coloring for which one of the color classes is a maximum
-free subset of if satisfies the following conditions; (1) is
not isomorphic to if is regular, (2) is not isomorphic to
if , and (3) is not an odd
cycle if is isomorphic to . Indeed, we show even more, by proving that
if are connected graphs with minimum degrees ,
respectively, and , then there is a partition of
vertices of to such that each is -free and
moreover one of s can be chosen in a way that is a maximum
-free subset of except either and is isomorphic to ,
each is isomorphic to and is not isomorphic to
, or each is isomorphic to and is not an odd
cycle.Comment: 8 page
Graph Powers and Graph Homomorphisms
In this paper we introduce a fractional power. Then, we present some properties of it. In this regard, we show that if G and H are two graphs and 1 β€ 2r+
A Generalization of the Erd\"{o}s-Ko-Rado Theorem
In this note, we investigate some properties of local Kneser graphs defined
in [8]. In this regard, as a generalization of the Erds-Ko-Rado
theorem, we characterize the maximum independent sets of local Kneser graphs.
Next, we present an upper bound for their chromatic number
- β¦