10,848 research outputs found
Hitting minors, subdivisions, and immersions in tournaments
The Erd\H{o}s-P\'osa property relates parameters of covering and packing of
combinatorial structures and has been mostly studied in the setting of
undirected graphs. In this note, we use results of Chudnovsky, Fradkin, Kim,
and Seymour to show that, for every directed graph (resp.
strongly-connected directed graph ), the class of directed graphs that
contain as a strong minor (resp. butterfly minor, topological minor) has
the vertex-Erd\H{o}s-P\'osa property in the class of tournaments. We also prove
that if is a strongly-connected directed graph, the class of directed
graphs containing as an immersion has the edge-Erd\H{o}s-P\'osa property in
the class of tournaments.Comment: Accepted to Discrete Mathematics & Theoretical Computer Science.
Difference with the previous version: use of the DMTCS article class. For a
version with hyperlinks see the previous versio
Polynomial expansion and sublinear separators
Let be a class of graphs that is closed under taking subgraphs.
We prove that if for some fixed , every -vertex graph of
has a balanced separator of order , then any
depth- minor (i.e. minor obtained by contracting disjoint subgraphs of
radius at most ) of a graph in has average degree . This confirms a conjecture of Dvo\v{r}\'ak
and Norin.Comment: 6 pages, no figur
Counting non-isomorphic maximal independent sets of the n-cycle graph
The number of maximal independent sets of the n-cycle graph C_n is known to
be the nth term of the Perrin sequence. The action of the automorphism group of
C_n on the family of these maximal independent sets partitions this family into
disjoint orbits, which represent the non-isomorphic (i.e., defined up to a
rotation and a reflection) maximal independent sets. We provide exact formulas
for the total number of orbits and the number of orbits having a given number
of isomorphic representatives. We also provide exact formulas for the total
number of unlabeled (i.e., defined up to a rotation) maximal independent sets
and the number of unlabeled maximal independent sets having a given number of
isomorphic representatives. It turns out that these formulas involve both
Perrin and Padovan sequences.Comment: Revised versio
On the semiclassical Laplacian with magnetic field having self-intersecting zero set
This paper is devoted to the spectral analysis of the Neumann realization of
the 2D magnetic Laplacian with semiclassical parameter h > 0 in the case when
the magnetic field vanishes along a smooth curve which crosses itself inside a
bounded domain. We investigate the behavior of its eigenpairs in the limit h
0. We show that each crossing point acts as a potential well,
generating a new decay scale of h 3/2 for the lowest eigenvalues, as well as
exponential concentration for eigenvectors around the set of crossing points.
These properties are consequences of the nature of associated model problems in
R 2 for which the zero set of the magnetic field is the union of two straight
lines. In this paper we also analyze the spectrum of model problems when the
angle between the two straight lines tends to 0
Error estimates for the numerical approximation of a distributed optimal control problem governed by the von K\'arm\'an equations
In this paper, we discuss the numerical approximation of a distributed
optimal control problem governed by the von Karman equations, defined in
polygonal domains with point-wise control constraints. Conforming finite
elements are employed to discretize the state and adjoint variables. The
control is discretized using piece-wise constant approximations. A priori error
estimates are derived for the state, adjoint and control variables under
minimal regularity assumptions on the exact solution. Numerical results that
justify the theoretical results are presented
- …