6,810 research outputs found
Dynamic concentration of the triangle-free process
The triangle-free process begins with an empty graph on n vertices and
iteratively adds edges chosen uniformly at random subject to the constraint
that no triangle is formed. We determine the asymptotic number of edges in the
maximal triangle-free graph at which the triangle-free process terminates. We
also bound the independence number of this graph, which gives an improved lower
bound on the Ramsey numbers R(3,t): we show R(3,t) > (1-o(1)) t^2 / (4 log t),
which is within a 4+o(1) factor of the best known upper bound. Our improvement
on previous analyses of this process exploits the self-correcting nature of key
statistics of the process. Furthermore, we determine which bounded size
subgraphs are likely to appear in the maximal triangle-free graph produced by
the triangle-free process: they are precisely those triangle-free graphs with
density at most 2.Comment: 75 pages, 1 figur
Generalization of binomial coefficients to numbers on the nodes of graphs
The triangular array of binomial coefficients, or Pascal's triangle, is formed by starting with an apex of 1. Every row of Pascal's triangle can be seen as a line-graph, to each node of which the corresponding binomial coefficient is assigned. We show that the binomial coefficient of a node is equal to the number of ways the line-graph can be constructed when starting with this node and adding subsequently neighboring nodes one by one. Using this interpretation we generalize the sequences of binomial coefficients on each row of Pascal's triangle to so-called Pascal graph numbers assigned to the nodes of an arbitrary (connected) graph. We show that on the class of connected cycle-free graphs the Pascal graph numbers have properties that are very similar to the properties of binomial coefficients. We also show that for a given connected cycle-free graph the Pascal graph numbers, when normalized to sum up to one, are equal to the steady state probabilities of some Markov process on the nodes. Properties of the Pascal graph numbers for arbitrary connected graphs are also discussed. Because the Pascal graph number of a node in a connected graph is defined as the number of ways the graph can be constructed by a sequence of increasing connected subgraphs starting from this node, the Pascal graph numbers can be seen as a measure of centrality in the graph
Triangle-free subgraphs of random graphs
Recently there has been much interest in studying random graph analogues of
well known classical results in extremal graph theory. Here we follow this
trend and investigate the structure of triangle-free subgraphs of with
high minimum degree. We prove that asymptotically almost surely each
triangle-free spanning subgraph of with minimum degree at least
is -close to bipartite,
and each spanning triangle-free subgraph of with minimum degree at
least is -close to
-partite for some . These are random graph analogues of a
result by Andr\'asfai, Erd\H{o}s, and S\'os [Discrete Math. 8 (1974), 205-218],
and a result by Thomassen [Combinatorica 22 (2002), 591--596]. We also show
that our results are best possible up to a constant factor.Comment: 18 page
Integer symmetric matrices having all their eigenvalues in the interval [-2,2]
We completely describe all integer symmetric matrices that have all their
eigenvalues in the interval [-2,2]. Along the way we classify all signed
graphs, and then all charged signed graphs, having all their eigenvalues in
this same interval. We then classify subsets of the above for which the integer
symmetric matrices, signed graphs and charged signed graphs have all their
eigenvalues in the open interval (-2,2).Comment: 33 pages, 18 figure
Dense subgraphs in the H-free process
The H-free process starts with the empty graph on n vertices and adds edges
chosen uniformly at random, one at a time, subject to the condition that no
copy of H is created, where H is some fixed graph. When H is strictly
2-balanced, we show that for some c,d>0, with high probability as , the final graph of the H-free process contains no subgraphs F on vertices with maximum density . This extends and generalizes results of Gerke and Makai for the C_3-free
process.Comment: 7 pages, revised versio
Lower bounds for Max-Cut in -free graphs via semidefinite programming
For a graph , let denote the size of the maximum cut in . The
problem of estimating as a function of the number of vertices and edges
of has a long history and was extensively studied in the last fifty years.
In this paper we propose an approach, based on semidefinite programming (SDP),
to prove lower bounds on . We use this approach to find large cuts in
graphs with few triangles and in -free graphs.Comment: 21 pages, to be published in LATIN 2020 proceedings, Updated version
is rewritten to include additional results along with corrections to original
argument
- …