129,285 research outputs found
On defensive alliances and line graphs
Let be a simple graph of size and degree sequence . Let denotes the line graph of
. The aim of this paper is to study mathematical properties of the
alliance number, , and the global alliance number,
, of the line graph of a simple graph. We show
that In particular, if is a -regular
graph (), then , and if is a
-semiregular bipartite graph, then . As a consequence of
the study we compare and , and we
characterize the graphs having . Moreover, we show that
the global-connected alliance number of is bounded by
where
denotes the diameter of , and we show that the global
alliance number of is bounded by . The case of
strong alliances is studied by analogy
A proof of Mader's conjecture on large clique subdivisions in -free graphs
Given any integers , we show there exists some such
that any -free graph with average degree contains a subdivision of
a clique with at least vertices. In particular,
when this resolves in a strong sense the conjecture of Mader in 1999 that
every -free graph has a subdivision of a clique with order linear in the
average degree of the original graph. In general, the widely conjectured
asymptotic behaviour of the extremal density of -free graphs suggests
our result is tight up to the constant .Comment: 25 pages, 1 figur
A note on Todorov surfaces
Let be a {\em Todorov surface}, {\it i.e.}, a minimal smooth surface of
general type with and having an involution such that is
birational to a surface and such that the bicanonical map of is
composed with
The main result of this paper is that, if is the minimal smooth model of
then is the minimal desingularization of a double cover of ramified over two cubics. Furthermore it is also shown that, given a
Todorov surface , it is possible to construct Todorov surfaces with
and such that is also the smooth minimal model of
where is the involution of Some examples are also
given, namely an example different from the examples presented by Todorov in
\cite{To2}.Comment: 9 page
Note on bipartite graph tilings
Let s<t be two fixed positive integers. We study what are the minimum degree
conditions for a bipartite graph G, with both color classes of size n=k(s+t),
which ensure that G has a K_{s,t}-factor. Exact result for large n is given.
Our result extends the work of Zhao, who determined the minimum degree
threshold which guarantees that a bipartite graph has a K_{s,s}-factor.Comment: 6 pages, no figures; statement of the main theorem corrected (thanks
to Andrzej Czygrinow and Louis DeBiasio); to appear in SIAM Journal on
Discrete Mathematic
Rainbow Turán Problems
For a fixed graph H, we define the rainbow Turán number ex^*(n,H) to be the maximum number of edges in a graph on n vertices that has a proper edge-colouring with no rainbow H. Recall that the (ordinary) Turán number ex(n,H) is the maximum number of edges in a graph on n vertices that does not contain a copy of H. For any non-bipartite H we show that ex^*(n,H)=(1+o(1))ex(n,H), and if H is colour-critical we show that ex^{*}(n,H)=ex(n,H). When H is the complete bipartite graph K_{s,t} with s ≤ t we show ex^*(n,K_{s,t}) = O(n^{2-1/s}), which matches the known bounds for ex(n,K_{s,t}) up to a constant. We also study the rainbow Turán problem for even cycles, and in particular prove the bound ex^*(n,C_6) = O(n^{4/3}), which is of the correct order of magnitude
- …