1,314 research outputs found
On the connection between the number of nodal domains on quantum graphs and the stability of graph partitions
Courant theorem provides an upper bound for the number of nodal domains of
eigenfunctions of a wide class of Laplacian-type operators. In particular, it
holds for generic eigenfunctions of quantum graph. The theorem stipulates that,
after ordering the eigenvalues as a non decreasing sequence, the number of
nodal domains of the -th eigenfunction satisfies . Here,
we provide a new interpretation for the Courant nodal deficiency in the case of quantum graphs. It equals the Morse index --- at a
critical point --- of an energy functional on a suitably defined space of graph
partitions. Thus, the nodal deficiency assumes a previously unknown and
profound meaning --- it is the number of unstable directions in the vicinity of
the critical point corresponding to the -th eigenfunction. To demonstrate
this connection, the space of graph partitions and the energy functional are
defined and the corresponding critical partitions are studied in detail.Comment: 22 pages, 6 figure
Short proofs of some extremal results
We prove several results from different areas of extremal combinatorics,
giving complete or partial solutions to a number of open problems. These
results, coming from areas such as extremal graph theory, Ramsey theory and
additive combinatorics, have been collected together because in each case the
relevant proofs are quite short.Comment: 19 page
Defective and Clustered Graph Colouring
Consider the following two ways to colour the vertices of a graph where the
requirement that adjacent vertices get distinct colours is relaxed. A colouring
has "defect" if each monochromatic component has maximum degree at most
. A colouring has "clustering" if each monochromatic component has at
most vertices. This paper surveys research on these types of colourings,
where the first priority is to minimise the number of colours, with small
defect or small clustering as a secondary goal. List colouring variants are
also considered. The following graph classes are studied: outerplanar graphs,
planar graphs, graphs embeddable in surfaces, graphs with given maximum degree,
graphs with given maximum average degree, graphs excluding a given subgraph,
graphs with linear crossing number, linklessly or knotlessly embeddable graphs,
graphs with given Colin de Verdi\`ere parameter, graphs with given
circumference, graphs excluding a fixed graph as an immersion, graphs with
given thickness, graphs with given stack- or queue-number, graphs excluding
as a minor, graphs excluding as a minor, and graphs excluding
an arbitrary graph as a minor. Several open problems are discussed.Comment: This is a preliminary version of a dynamic survey to be published in
the Electronic Journal of Combinatoric
Density theorems for bipartite graphs and related Ramsey-type results
In this paper, we present several density-type theorems which show how to
find a copy of a sparse bipartite graph in a graph of positive density. Our
results imply several new bounds for classical problems in graph Ramsey theory
and improve and generalize earlier results of various researchers. The proofs
combine probabilistic arguments with some combinatorial ideas. In addition,
these techniques can be used to study properties of graphs with a forbidden
induced subgraph, edge intersection patterns in topological graphs, and to
obtain several other Ramsey-type statements
- …