8 research outputs found
The minimum number of triangular edges and a symmetrization method for multiple graphs
We give an asymptotic formula for the minimum number of edges contained in
triangles in a graph having n vertices and e edges. Our main tool is a
generalization of Zykov's symmetrization method that can be applied for several
graphs simultaneously.Comment: Same paper, better presentation. Now it has 10 pages with 7 figure
The dimension of the region of feasible tournament profiles
Erd\H os, Lov\'asz and Spencer showed in the late 1970s that the dimension of
the region of -vertex graph profiles, i.e., the region of feasible densities
of -vertex graphs in large graphs, is equal to the number of non-trivial
connected graphs with at most vertices. We determine the dimension of the
region of -vertex tournament profiles. Our result, which explores an
interesting connection to Lyndon words, yields that the dimension is much
larger than just the number of strongly connected tournaments, which would be
the answer expected as the analogy to the setting of graphs
is almost a fractalizer
We determine the maximum number of induced copies of a 5-cycle in a graph on
vertices for every . Every extremal construction is a balanced iterated
blow-up of the 5-cycle with the possible exception of the smallest level where
for , the M\"obius ladder achieves the same number of induced 5-cycles as
the blow-up of a 5-cycle on 8 vertices.
This result completes work of Balogh, Hu, Lidick\'y, and Pfender [Eur. J.
Comb. 52 (2016)] who proved an asymptotic version of the result. Similarly to
their result, we also use the flag algebra method but we extend its use to
small graphs.Comment: 24 page
Maximum Number of Almost Similar Triangles in the Plane
A triangle T′ is ε-similar to another triangle T if their angles pairwise differ by at most ε. Given a triangle T, ε\u3e0 and n∈N, Bárány and Füredi asked to determine the maximum number of triangles h(n,T,ε) being ε-similar to T in a planar point set of size n. We show that for almost all triangles T there exists ε=ε(T)\u3e0 such that h(n,T,ε)=n3/24(1+o(1)). Exploring connections to hypergraph Turán problems, we use flag algebras and stability techniques for the proof
Minimum number of edges that occur in odd cycles
If a graph has vertices and more than edges, then it
contains a copy of . In 1992, Erd\H{o}s, Faudree and Rousseau showed
even more, that the number of edges that occur in a triangle is at least
, and this bound is tight. They also showed that the
minimum number of edges that occur in a for is at least
, and conjectured that for any , the correct lower bound
should be . Very recently, F\"uredi and Maleki constructed a
counterexample for and proved asymptotically matching lower bound, namely
that for any graphs with edges contain
at least edges that occur in .
In this paper, we use a different approach to tackle this problem and obtain
the following stronger result: Any -vertex graph with at least edges has at least edges that
occur in . Next, for all and sufficiently large, we determine
the exact minimum number of edges that occur in for -vertex
graphs with more than edges, and show it is indeed equal to
.
For both results, we give a structural description of the extremal
configurations as well as obtain the corresponding stability results, which
answer a conjecture of F\"uredi and Maleki.
The main ingredient is a novel approach that combines the flag algebras
together with ideas from finite forcibility of graph limits. This approach
allowed us to keep track of the extra edge needed to guarantee an existence of
a . Also, we establish the first application of semidefinite method
in a setting, where the set of tight examples has exponential size, and arises
from different constructions
Minimizing the Number of Triangular Edges
We consider the problem of minimizing the number of edges that are contained in triangles, among n-vertex graphs with a given number of edges. For sufficiently large n, we prove an exact formula for this minimum, which partially resolves a conjecture of Füredi and Maleki
Recommended from our members
Combinatorics and Probability
For the past few decades, Combinatorics and Probability Theory have had a fruitful symbiosis, each benefitting from and influencing developments in the other. Thus to prove the existence of designs, probabilistic methods are used, algorithms to factorize integers need combinatorics and probability theory (in addition to number theory), and the study of random matrices needs combinatorics. In the workshop a great variety of topics exemplifying this interaction were considered, including problems concerning designs, Cayley graphs, additive number theory, multiplicative number theory, noise sensitivity, random graphs, extremal graphs and random matrices
Recommended from our members
Tilings and other combinatorial results
In this dissertation we treat three tiling problems and three problems in combinatorial geometry, extremal graph theory and sparse Ramsey theory.
We first consider tilings of . In this setting a tile is just a finite subset of . We say that tiles if the latter set admits a partition into isometric copies of . Chalcraft observed that there exist that do not tile but tile for some . He conjectured that such exists for any given tile. We prove this conjecture in Chapter 2.
In Chapter 3 we prove a conjecture of Lonc, stating that for any poset of size a power of , if has a greatest and a least element, then there is a positive integer such that can be partitioned into copies of .
The third tiling problem is about vertex-partitions of the hypercube graph . Offner asked: if is a subgraph of such is a power of , must , for some , admit a partition into isomorphic copies of ? In Chapter 4 we answer this question in the affirmative.
We follow up with a question in combinatorial geometry. A line in a planar set is a maximal collinear subset of . P\'or and Wood considered colourings of finite without large lines with a bounded number of colours. In particular, they examined whether monochromatic lines always appear in such colourings provided that is large. They conjectured that for all there exists an such that if and does not contain a line of cardinality larger than , then every colouring of with colours produces a monochromatic line. In Chapter 5 we construct arbitrarily large counterexamples for the case .
We follow up with a problem in extremal graph theory. For any graph, we say that a given edge is triangular if it forms a triangle with two other edges. How few triangular edges can there be in a graph with vertices and edges? For sufficiently large we prove a conjecture of F\"uredi and Maleki that gives an exact formula for this minimum. This proof is given in Chapter 6.
Finally, Chapter 7 is concerned with degrees of vertices in directed hypergraphs. One way to prescribe an orientation to an -uniform graph is to assign for each of its edges one of the possible orderings of its elements. Then, for any -set of vertices and any -set of indices , we define the -degree of to be the number of edges containing vertices in precisely the positions labelled by . Caro and Hansberg were interested in determining whether a given -uniform hypergraph admits an orientation where every set of vertices has some -degree equal to . They conjectured that a certain Hall-type condition is sufficient. We show that this is true for large, but false in general.EPSR