16 research outputs found
Graphs with few 3-cliques and 3-anticliques are 3-universal
For given integers k, l we ask whether every large graph with a sufficiently
small number of k-cliques and k-anticliques must contain an induced copy of
every l-vertex graph. Here we prove this claim for k=l=3 with a sharp bound. A
similar phenomenon is established as well for tournaments with k=l=4.Comment: 12 pages, 1 figur
A simultaneous generalization of independence and disjointness in boolean algebras
We give a definition of some classes of boolean algebras generalizing free
boolean algebras; they satisfy a universal property that certain functions
extend to homomorphisms. We give a combinatorial property of generating sets of
these algebras, which we call n-independent. The properties of these classes
(n-free and omega-free boolean algebras) are investigated. These include
connections to hypergraph theory and cardinal invariants on these algebras.
Related cardinal functions, Ind, which is the supremum of the cardinalities
of n-independent subsets; i_n, the minimum size of a maximal n-independent
subset; and i_omega, the minimum size of an omega-independent subset, are
introduced and investigated. The values of i_n and i_omega on P(omega)/fin are
shown to be independent of ZFC.Comment: Sumbitted to Orde
On the number of 4-cycles in a tournament
If is an -vertex tournament with a given number of -cycles, what
can be said about the number of its -cycles? The most interesting range of
this problem is where is assumed to have cyclic triples for
some and we seek to minimize the number of -cycles. We conjecture that
the (asymptotic) minimizing is a random blow-up of a constant-sized
transitive tournament. Using the method of flag algebras, we derive a lower
bound that almost matches the conjectured value. We are able to answer the
easier problem of maximizing the number of -cycles. These questions can be
equivalently stated in terms of transitive subtournaments. Namely, given the
number of transitive triples in , how many transitive quadruples can it
have? As far as we know, this is the first study of inducibility in
tournaments.Comment: 11 pages, 5 figure
Set Theory
This workshop included selected talks on pure set theory and its applications, simultaneously showing diversity and coherence of the subject
Metrically homogeneous graphs of diameter 3
We classify countable metrically homogeneous graphs of diameter 3
Tur\'an and Ramsey problems for alternating multilinear maps
Guided by the connections between hypergraphs and exterior algebras, we study
Tur\'an and Ramsey type problems for alternating multilinear maps. This study
lies at the intersection of combinatorics, group theory, and algebraic
geometry, and has origins in the works of Lov\'asz (Proc. Sixth British
Combinatorial Conf., 1977), Buhler, Gupta, and Harris (J. Algebra, 1987), and
Feldman and Propp (Adv. Math., 1992).
Our main result is a Ramsey theorem for alternating bilinear maps. Given , , and an alternating bilinear map with , we show that there exists either a dimension-
subspace such that , or a dimension- subspace
such that . This result has natural
group-theoretic (for finite -groups) and geometric (for Grassmannians)
implications, and leads to new Ramsey-type questions for varieties of groups
and Grassmannians.Comment: 20 pages. v3: rewrite introductio