A Hilton-Milner Theorem for Vector Spaces
|
|
- Holly Willis
- 5 years ago
- Views:
Transcription
1 A Hilton-Milner Theorem for ector Spaces A Blohuis, A E Brouwer, A Chowdhury 2, P Franl 3, T Mussche, B Patós 4, and T Szőnyi 5,6 Dept of Mathematics, Technological University Eindhoven, PO Box 53, 5600 MB Eindhoven, The Netherlands 2 Dept of Mathematics, University of California San Diego, La Jolla, CA 92093, USA 3 ShibuYa-Ku, Higashi, Toyo, 50, Japan 4 Department of Computer Science, University of Memphis, TN , USA 5 Institute of Mathematics, Eötvös Loránd University, H-7 Budapest, Pázmány P s /C, Hungary 6 Computer and Automation Research Institute, Hungarian Academy of Sciences, H- Budapest, Lágymányosi ú, Hungary aartb@wintuenl, aeb@cwinl, anchowdh@mathucsdedu, peterfranl@gmailcom, bpatos@memphisedu, tmussche@gmailcom, szonyi@cseltehu Submitted: Nov, 2009; Accepted: May 4, 200; Published: May 4, 200 Mathematics Subject Classification: 05D05, 05A30 Abstract We show for 2 that if q 3 and n 2 +, or q = 2 and n 2 + 2, then any intersecting family F of -subspaces of an n-dimensional vector space over GF(q) with F F F = 0 has size at most n q ( ) n + q This bound is sharp as is shown by Hilton-Milner type families As an application of this result, we determine the chromatic number of the corresponding q-kneser graphs Introduction Sets Let X be an n-element set and, for 0 n, let ( X ) denote the family of all subsets of X of cardinality A family F ( X ) is called intersecting if for all F, F 2 F we have F F 2 Erdős, Ko, and Rado 5 determined the maximum size of an intersecting family, and introduced the so-called shifting technique the electronic journal of combinatorics 7 (200), #R7
2 Theorem (Erdős-Ko-Rado) Suppose F ( X ) is intersecting and n 2 Then F ( { ( n ) Excepting the case n = 2, equality holds only if F = F X ) } : x F for some x X For any family F ( X ), the covering number τ(f) is the minimum size of a set that meets all F F Theorem shows that if F ( X ) is an intersecting family of maximum size and n > 2, then τ(f) = Hilton and Milner 5 determined the maximum size of an intersecting family with τ(f) 2 Later, Franl and Füredi 9 gave an elegant proof of Theorem 2 using the shifting technique Theorem 2 (Hilton-Milner) Let F ( X ) be an intersecting family with 2, n 2 +, and τ(f) 2 Then F ( ) ( n n ) + Equality holds only if (i) F = {F } {G ( X ) : x G, F G } for some -subset F and x X \ F (ii) F = {F ( X 3) : F S 2} for some 3-subset S if = 3 2 ector spaces Theorem and Theorem 2 have natural extensions to vector spaces We let always denote an n-dimensional vector space over the finite field GF(q) For Z +, we write to denote the family of all -dimensional subspaces of For a, q Z+, define the Gaussian binomial coefficient by a := q a i q q i 0 i< A simple counting argument shows that the size of q is n From now on, we will q omit the subscript q If two subspaces of intersect in the zero subspace, then we say they are disjoint or that they trivially intersect; otherwise we say the subspaces non-trivially intersect A family F is called intersecting if any two -spaces in F non-trivially intersect The maximum size of an intersecting family of -spaces was first determined by Hsieh 6 For alternate proofs of Theorem 3, see 4 and We remar that there is as yet no analog of the shifting technique for vector spaces Theorem 3 (Hsieh) Suppose F is intersecting and n 2 Then F n Equality holds if and only if F = { F : v F } for some one-dimensional subspace v, unless n = 2 Let the covering number τ(f) of a family F be defined as the minimum dimension of a subspace of that intersects all elements of F nontrivially Theorem 3 shows that, as in the set case, if F is a maximum intersecting family of -spaces, then τ(f) = Families satisfying τ(f) = are nown as point-pencils the electronic journal of combinatorics 7 (200), #R7 2
3 In this paper, we will extend Theorem 2 to vector spaces, and determine the maximum size of an intersecting family F with τ(f) 2 For two subspaces S, T, we let S +T denote their linear span We observe that for a fixed -subspace E and a -subspace U with E U, the family F E,U = {U} {W : E W, dim(w U) } is not maximal as we can add all subspaces in E+U that are not in FE,U We will say that F is an HM-type family if F = { W } : E W, dim(w U) E+U for some E and U with E U If F is an HM-type family, then its size is n n F = f(n,, q) := q ( ) + q () The main result of the paper is the following theorem Theorem 4 Suppose 3, and either q 3 and n 2 +, or q = 2 and n 2 +2 For any intersecting family F with τ(f) 2, we have F f(n,, q) (with f(n,, q) as in ()) Equality holds only if (i) F is an HM-type family, (ii) F = F 3 = {F : dim(s F) 2} for some S 3 if = 3 Furthermore, if 4, then there exists an ǫ > 0 (independent of n,, q) such that if F ( ǫ)f(n,, q), then F is a subfamily of an HM-type family If = 2, then a maximal intersecting family F of -spaces with τ(f) > is the family of all 2-subspaces of a 3-subspace, and the conclusion of the theorem holds After proving Theorem 4 in Section 2, we apply this result to determine the chromatic number of q-kneser graphs The vertex set of the q-kneser graph qk n: is Two vertices of qk n: are adjacent if and only if the corresponding -subspaces are disjoint In 3, the chromatic number of the q-kneser graph qk n:2 is determined, and the minimum colorings are characterized In 8, the chromatic number of the q-kneser graph is determined in general for q > q In Section 4, we prove the following theorem Theorem 5 If 3, and either q 3 and n 2 +, or q = 2 and n 2 + 2, then the chromatic number of the q-kneser graph is χ(qk n: ) = n + Moreover, each color class of a minimum coloring is a point-pencil and the points determining a color are the points of an (n + )-dimensional subspace In Section 5, we prove the non-uniform version of the Erdős-Ko-Rado theorem Theorem 6 Let F be an intersecting family of subspaces of the electronic journal of combinatorics 7 (200), #R7 3
4 (i) If n is even, then F n n/2 + n i>n/2 i (ii) If n is odd, then F i>n/2 n i For even n, equality holds only if F = >n/2 {F n/2 : E F } for some E, or if F = >n/2 U for some U For odd n, equality holds only if F = n/2 n >n/2 Note that Theorem 6 follows from the profile polytope of intersecting families which was determined implicitly by Bey and explicitly by Gerbner and Patós 2, but the proof we present in Section 5 is simple and direct 2 Proof of Theorem 4 This section contains the proof of Theorem 4 which we divide into two cases 2 The case τ(f) = 2 For any A and F, let FA = {F F : A F } First, let us state some easy technical lemmas Lemma 2 Let a 0 and n a + and q 2 Then n a n a < a (q )q n 2 a Proof The inequality to be proved simplifies to (q a )(q )q n 2 < q n a Lemma 22 Let E If E L, where L is an l-subspace, then the number of -subspaces of containing E and intersecting L is at least l n 2 2 q l n (with equality for l = 2), and at most l n 2 2 Proof The -spaces containing E and intersecting L in a -dimensional space are counted exactly once in the first term Those subspaces that intersect L in a 2-dimensional space are counted 2 = q+ times in the first term and q times in the second term, thus once overall If a subspace intersects L in a subspace of dimension i 3, then it is counted i times in the first term and q i 2 times in the second term, and hence a negative number of times overall Our next lemma gives bounds on the size of an HM-type family that are easier to wor with than the precise formula mentioned in the introduction Lemma 23 Let n 2 +, 3 and q 2 If F is an HM-type family, then ( ) n 2 q 3 q 2 < n 2 2 q n f(n,, q) = F n 2 2 the electronic journal of combinatorics 7 (200), #R7 4
5 Proof Since q 2 = ( )/(q + ) and n 2 +, the first inequality follows from Lemma 2 Let F be the HM-type family defined by the -space E and the -space U Then F contains all -subspaces of containing E and intersecting U, so that the second inequality follows from Lemma 22 For the last inequality, Lemma 22 almost suffices, but we also have to count the -subspaces of E+U that do not contain E Each ( )-subspace W of U is contained in q + such subspaces, one of which is E + W On the other hand, E + W was counted at least q + times since 3 This proves the last inequality Lemma 24 If a subspace S does not intersect each element of F, then there is a subspace T > S with dim T = dim S + and F T F S / Proof There is an F F such that S F = 0 Average over all T = S + E where E is a -subspace of F Lemma 25 If an s-dimensional subspace S does not intersect each element of F, then F S n s s Proof There is an (s + )-space T with n s s FT F S / Corollary 26 Let F be an intersecting family with τ(f) s Then for any i-space L with i s we have F L s i n s s Proof If i = s, then clearly F L n s s If i < s, then there exists an F F such that F L = 0; now apply Lemma 24 s i times Before proving the q-analogue of the Hilton-Milner theorem, we describe the essential part of maximal intersecting families F with τ(f) = 2 Proposition 27 Let n 2 and let F be a maximal intersecting family with τ(f) = 2 Define T to be the family of 2-spaces of that intersect all subspaces in F One of the following three possibilities holds: (i) T = and n 2 2 < F < n 2 ( 2 + (q + ) ) n 3 3 ; (ii) T >, τ(t ) =, and there is an (l + )-space W (with 2 l ) and a -space E W so that T = {M : E M W, dim M = 2} In this case, l n 2 2 q l n F l n ( l ) n q l n l l For l = 2, the upper bound can be strengthened to F (q + ) n 2 2 q n ( 2 ) n q 2 n 3 3 ; (iii) T = A 2 for some 3-subspace A and F = {U : dim(u A) 2} In this case, F = (q 2 + q + )( n 2 2 n 3 3 ) + n 3 3 the electronic journal of combinatorics 7 (200), #R7 5
6 Proof Let F be a maximal intersecting family with τ(f) = 2 By maximality, F contains all -spaces containing a T T Since n 2 and 2, two disjoint elements of T would be contained in disjoint elements of F, which is impossible Hence, T is intersecting Observe that if A, B T and A B < C < A + B, then C T As an intersecting family of 2-spaces is either a family of 2-spaces containing some fixed -space E or a family of 2-subspaces of a 3-space, we get the following: ( ): T is either a family of all 2-subspaces containing some fixed -space E that lie in some fixed (l + )-space with l, or T is the family of all 2-subspaces of a 3-space (i) : If T =, then let S denote the only 2-space in T and let E S be any -space Since τ(f) >, there exists an F F with E F, for which we must have dim(f S) = As S is the only element of T, for any -subspace E of F different from F S, we have F E+E n 3 3 by Lemma 25 Hence the number of subspaces n 3 containing E but not containing S is at most ( ) 3 This gives the upper bound (ii) : Assume that τ(t ) = and T > By ( ), T is the set of 2-spaces in an (l+)- space W (with l 2) containing some fixed -space E Every F F \ F E intersects W in a hyperplane Let L be a hyperplane in W not on E Then F contains all -spaces on E that intersect L Hence the lower bound and the first term in the upper bound come from Lemma 22 The second term comes from using Lemma 25 to count the -spaces of F that contain E and intersect a given F F (not containing E) in a point of F \ W If l 3, then there are q l hyperplanes in W not containing E and there are n l l -spaces through such a hyperplane; this gives the last term For l = 2, we use the tight lower bound in Lemma 22 to count the number of -spaces on E that intersect L There are q 2 hyperplanes in W, and they cannot be in T, so Lemma 25 gives the bound (iii) : This is immediate Corollary 28 Let F be a maximal intersecting family with τ(f) = 2 Suppose q 3 and n 2 +, or q = 2 and n If F is at least as large as an HM-type family and > 3, then F is an HM-type family If = 3, then F is an HM-type family or an F 3 -type family There exists an ǫ > 0 (independent of n,, q) such that if 4 and F is at least ( ǫ) times the size of an HM-type family, then F is an HM-type family Proof Apply Proposition 27 Note that the HM-type families are precisely those from case (ii) with l = Let n = 2 + r where r We have F / n 2 2 < + q+ (q )q in case (i) of r Proposition 27 by Lemma 2 We have F / n 2 2 < ( + ) q (q )q r + q 2 in case (ii) (q )q r when l < In both cases, for q 3 and 3, or q = 2, 4, and r 2, this is less than ( ǫ) times the lower bound on the size of an HM-type family given in Lemma 23 Using the stronger estimate in Lemma 23, we find the same conclusion for q = 2, = 3, and r 2 the electronic journal of combinatorics 7 (200), #R7 6
7 n 2 n 3 In case (iii), F 3 = q 3 q q 3 For 4, this is much smaller than the size of the HM-type families For = 3, the two families have the same size Proposition 29 Suppose that 3 and n 2 Let F be an intersecting family with τ(f) 2 Let 3 l If there is an l-space that intersects each F F and then there is an (l )-space that intersects each F F F > l l n l l, (22) Proof By averaging, there is a -space P with F P F / l If τ(f) = l, then by Corollary 26, F l l n l l, contradicting the hypothesis Corollary 20 Suppose 3 and either q 3 and n 2+, or q = 2 and n 2+2 Let F be an intersecting family with τ(f) 2 If F > 3 2 n 3 3, then τ(f) = 2; that is, F is contained in one of the systems in Proposition 27, which satisfy the bound on F Proof By Lemma 2 and the conditions on n and q, the right hand side of (22) decreases as l increases, where 3 l Hence, by Proposition 29, we can find a 2-space that intersects each F F Remar 2 For n 3, all systems described in Proposition 27 occur 22 The case τ(f) > 2 Suppose that F is an intersecting family and τ(f) = l > 2 We shall derive a contradiction from F f(n,, q), and even from F ( ǫ)f(n,, q) for some ǫ > 0 (independent of n,, q) 22 The case l = First consider the case l = Then F by Corollary 26 On the other hand, ( ) F n 2 ( ) q 3 q 2 > ( ) q 3 q (q )q n 2 2 by Lemma 23 and Lemma 2 If either q 3, n 2+ or q = 2, n 2+2, then either = 3, (n,, q) = (9, 4, 3), or (n,, q) = (0, 4, 2) If (n,, q) = (9, 4, 3) then f(n,, q) = , and 40 4 = , which gives a contradiction If (n,, q) = (0, 4, 2), then f(n,, q) = 537, and 5 4 = 50625, which again gives a contradiction Hence = 3 Now F ( ) n 2 q 3 q 2 gives a contradiction for n 8, so n = 7 Therefore, if we assume that n 2 + and either q 3, (n, ) (7, 3) or q = 2, n then we are not in the case l = It remains to settle the case n = 7, = l = 3, and q 3 By Lemma 24, we can choose a -space E such that F E F / 3 and a 2-space S on E such that FS F E / 3 the electronic journal of combinatorics 7 (200), #R7 7
8 Then F S > q+ since F > Pic F F disjoint from S and define H := S+F All F F S are contained in the 5-space H Since F > 5 3, there is an F0 F not contained in H If F 0 S = 0, then each F F S is contained in S +(H F 0 ); this implies F S q +, which is impossible Thus, all elements of F disjoint from S are in H Now F 0 must meet F and S, so F 0 meets H in a 2-space S 0 Since F S > q +, we can find two elements F, F 2 of F S with the property that S 0 is not contained in the 4-space F +F 2 Since any F F disjoint from S is contained in H and meets F 0, it must meet S 0 and also F and F 2 Hence the number of such F s is at most q 5 Altogether F q ; the first term comes from counting F F disjoint from S and the second term comes from counting F F on a given one-dimensional subspace E < S This contradicts F ( q 3 q ) The case l < Assume, for the moment, that there are two l-subspaces in that non-trivially intersect all F F, and that these two l-spaces meet in an m-space, where 0 m l By Corollary 26, for each -subspace P we have F P l n l l, and for each 2-subspace L we have F L l 2 n l l Consequently, F m l n l l + ( l m ) 2 l 2 n l l (23) The upper bound (23) is a quadratic in x = m and is largest at one of the extreme values x = 0 and x = l The maximum is taen at x = 0 only when l 2 > l 2 ; that is, when = l Since we assume that l <, the upper bound in (23) is largest for m = l We find F l l n l l + ( l l ) 2 l 2 n l l On the other hand, F ( q 3 q ) n 2 2 > ( ) l n l q 3 q l ((q )q n 2 ) l 2 Comparing these, and using > l, n 2 +, and n if q = 2, we find either (n,, l, q) = (9, 4, 3, 3) or q = 2, n = 2 + 2, l = 3, and 5 If (n,, l, q) = (9, 4, 3, 3) then f(n,, q) = , while the upper bound is , which is a contradiction If (n,, l, q) = (2, 5, 3, 2) then f(n,, q) = , while the upper bound is , which is a contradiction If (n,, l, q) = (0, 4, 3, 2) then f(n,, q) = 537, while the upper bound is 6205, which is a contradiction Hence, under our assumption that there are two distinct l-spaces that meet all F F, the case 2 < l < cannot occur We now assume that there is a unique l-space T that meets all F F We can pic a -space E < T such that F E F / l Now there is some F F not on E, so E is in lines such that each F FE contains at least one of these lines Suppose L is one of these lines and L does not lie in T; we can enlarge L to an l-space that still does not the electronic journal of combinatorics 7 (200), #R7 8
9 meet all elements of F, so F L l n l l by Lemma 24 and Lemma 25 If L does lie on T, we have F L l 2 n l l by Corollary 26 Hence, F l FE ( l l ( l 2 n l l ) + ( l )( l n l ) l ) On the other hand, we have F > ( ) q 3 q ((q )q n 2 ) l 2 l n l l Under our standard assumptions n 2 + and n if q = 2, this implies q = 2, n = 2 + 2, l = 3, which gives a contradiction We showed: If q 3 and n 2 + or if q = 2 and n 2 + 2, then an intersecting family F with F f(n,, q) must satisfy τ(f) 2 Together with Corollary 28, this proves Theorem 4 3 Critical families A subspace will be called a hitting subspace (and we shall say that the subspace intersects F), if it intersects each element of F The previous results just used the parameter τ, so only the hitting subspaces of smallest dimension were taen into account A more precise description is possible if we mae the intersecting system of subspaces critical Definition 3 An intersecting family F of subspaces of is critical if for any two distinct F, F F we have F F, and moreover for any hitting subspace G there is a F F with F G Lemma 32 For every non-extendable intersecting family F of -spaces there exists some critical family G such that F = {F : G G, G F } Proof Extend F to a maximal intersecting family H of subspaces of, and tae for G the minimal elements of H The following construction and result are an adaptation of the corresponding results from Erdős and Lovász 6: Construction 33 Let A,, A be subspaces of such that dim A i = i and dim(a + + A ) = ( ) + 2 Define F i = {F : Ai F, dim A j F = for j > i} Then F = F F is a critical, non-extendable, intersecting family of -spaces, and F i = i+ i+2 for i the electronic journal of combinatorics 7 (200), #R7 9
10 For subsets Erdős and Lovász proved that a critical, non-extendable, intersecting family of -sets cannot have more than members They conjectured that the above construction is best possible but this was disproved by Franl, Ota and Toushige 0 Here we prove the following analogous result Theorem 34 Let F be a critical, intersecting family of subspaces of of dimension at most Then F Proof Suppose that F > By induction on i, 0 i, we find an i-dimensional subspace A i of such that F Ai > i Indeed, since by induction FAi > and F is critical, the subspace A i is not hitting, and there is an F F disjoint from A i Now all elements of F Ai meet F, and we find A i+ > A i with F Ai+ > F Ai / For i = this is a contradiction Remar 35 For l this argument shows that there are not more than l l-spaces in F If l = 3 and τ > 2 then for the size of F the previous remar essentially gives 3 2 n 3 3, which is the bound in Corollary 20 Modifying the Erdős-Lovász construction (see Franl 7), one can get intersecting families with many l-spaces in the corresponding critical family Construction 36 Let A,,A l be subspaces with dim A =, dim A i = + i l for i 2 Define F i = {F : Ai F, dim(f A j ) for j > i} Then F F l is intersecting and the corresponding critical family has at least l+2 l-spaces For n large enough the Erdős-Ko-Rado theorem for vector spaces follows from the obvious fact that no critical, intersecting family can contain more than one -dimensional member The Hilton-Milner theorem and the stability of the systems follow from ( ) which was used to describe the intersecting systems with τ = 2 As remared above, the fact that the critical family has to contain only spaces of dimension 3 or more limits its size to O( n 3 ), if is fixed and n is large enough Stronger and more general stability theorems can be found in Franl 8 for the subset case 4 Coloring q-kneser graphs In this section, we prove Theorem 5 We will need the following result of Bose and Burton 2 and its extension by Metsch 7 Theorem 4 (Bose-Burton) If E is a family of -subspaces of such that any - subspace of contains at least one element of E, then E n + Furthermore, equality holds if and only if E = H for some (n + )-subspace H of l the electronic journal of combinatorics 7 (200), #R7 0
11 Proposition 42 (Metsch) If E is a family of n + ε -subspaces of, then the number of -subspaces of that are disjoint from all E E is at least εq ( )(n ) Proof of Theorem 5 Suppose that we have a coloring with at most n + colors Let G (the good colors) be the set of colors that are point-pencils and let B (the bad colors) be the remaining set of colors Then G + B n + Suppose B = ε > 0 By Proposition 42, the number of -spaces with a color in B is at least εq ( )(n ), so that the average size of a bad color class is at least q ( )(n ) This must be smaller than the size of a HM-type family Thus, by Lemma 23, n 2 q ( )(n ) 2 For 3 and q 3, n 2 + or q = 2, n 2 +2, this is a contradiction (The weaer form of Proposition 42, as stated in 7, suffices unless q = 2, n = 2 + 2) If B = 0, all color classes are point-pencils, and we are done by Theorem 4 5 Proof of Theorem 6 Let a + b = n, a < b and let F a = F a and Fb = F b We prove F a + F b n b (54) with equality only if F a = and F b = b Adding up (54) for n/2 < b n gives the bound on F in Theorem 6 if n is odd; adding the result of Greene and Kleitman 4 that states F n/2 n n/2 proves it for even n For the uniqueness part of Theorem 6, we only have to note that if n is even then, by results of Godsil and Newman 3, we must have F n/2 = {F n/2 : E F } or Fn/2 = U n/2 for some U for some E n Now we prove (54) Consider the bipartite graph with vertex set ( a, b ) and join A a and B b if A B = 0 Observe that Fa F b is an independent set in this graph Now, this graph is regular with degree q ab Therefore any independent set in this graph has size at most n b by König s Theorem Moreover, independent sets of size n b can only be a or b, but the former is not an intersecting family This proves (54) Acnowledgements Ameera Chowdhury thans the NSF for supporting her and the Rényi Institute for hosting her while she was an NSF-CESRI fellow during the summer of 2008 Balázs Patós s research was supported by NSF Grant #: CCF Tamás Szőnyi gratefully acnowledges the financial support of NWO, including the support of the DIAMANT and Spinoza projects He also thans the Department of Mathematics at TU/e for the warm hospitality He was partly supported by OTKA Grants T and NK the electronic journal of combinatorics 7 (200), #R7
12 References C Bey Polynomial LYM inequalities Combinatorica, 25():9 38, R C Bose and R C Burton A characterization of flat spaces in a finite geometry and the uniqueness of the Hamming and the MacDonald codes J Combin Theory, :96 04, A Chowdhury, C Godsil, and G Royle Colouring lines in projective space J Combin Theory Ser A, 3():39 52, A Chowdhury and B Patós Shadows and intersections in vector spaces J Combin Theory Ser A, to appear 5 P Erdős, C Ko, and R Rado Intersection theorems for systems of finite sets Quart J Math Oxford Ser (2), 2:33 320, 96 6 P Erdős and L Lovász Problems and results on 3-chromatic hypergraphs and some related questions In Infinite and finite sets (Colloq, Keszthely, 973; dedicated to P Erdős on his 60th birthday), ol II, pages Colloq Math Soc János Bolyai, ol 0 North-Holland, Amsterdam, P Franl On families of finite sets no two of which intersect in a singleton Bull Austral Math Soc, 7():25 34, P Franl On intersecting families of finite sets J Combin Theory Ser A, 24(2):46 6, P Franl and Z Füredi Nontrivial intersecting families J Combin Theory Ser A, 4():50 53, P Franl, K Ota, and N Toushige Covers in uniform intersecting families and a counterexample to a conjecture of Lovász J Combin Theory Ser A, 74():33 42, 996 P Franl and R M Wilson The Erdős-Ko-Rado theorem for vector spaces J Combin Theory Ser A, 43(2): , D Gerbner and B Patós Profile vectors in the lattice of subspaces Discrete Math, 309(9): , CD Godsil and MW Newman Independent sets in association schemes Combinatorica, 26(4):43 443, C Greene and DJ Kleitman Proof techniques in the theory of finite sets In Studies in combinatorics, MAA Stud Math 7, pages A J W Hilton and E C Milner Some intersection theorems for systems of finite sets Quart J Math Oxford Ser (2), 8: , WN Hsieh Intersection theorems for systems of finite vector spaces Discrete Math, 2: 6, K Metsch How many s-subspaces must miss a point set in PG(d, q) J Geom, 86(-2):54 64, T Mussche Extremal combinatorics in generalized Kneser graphs PhD thesis, Technical University Eindhoven, 2009 the electronic journal of combinatorics 7 (200), #R7 2
On the chromatic number of q-kneser graphs
On the chromatic number of q-kneser graphs A. Blokhuis & A. E. Brouwer Dept. of Mathematics, Eindhoven University of Technology, P.O. Box 53, 5600 MB Eindhoven, The Netherlands aartb@win.tue.nl, aeb@cwi.nl
More informationA DEGREE VERSION OF THE HILTON MILNER THEOREM
A DEGREE VERSION OF THE HILTON MILNER THEOREM PETER FRANKL, JIE HAN, HAO HUANG, AND YI ZHAO Abstract An intersecting family of sets is trivial if all of its members share a common element Hilton and Milner
More informationOn q-analogues and stability theorems
On q-analogues and stability theorems Aart Blokhuis, Andries Brouwer, Tamás Szőnyi and Zsuzsa Weiner Abstract. In this survey recent results about q-analogues of some classical theorems in extremal set
More informationCocliques in the Kneser graph on line-plane flags in PG(4, q)
Cocliques in the Kneser graph on line-plane flags in PG(4, q) A. Blokhuis & A. E. Brouwer Abstract We determine the independence number of the Kneser graph on line-plane flags in the projective space PG(4,
More informationAlmost Cross-Intersecting and Almost Cross-Sperner Pairs offamilies of Sets
Almost Cross-Intersecting and Almost Cross-Sperner Pairs offamilies of Sets Dániel Gerbner a Nathan Lemons b Cory Palmer a Balázs Patkós a, Vajk Szécsi b a Hungarian Academy of Sciences, Alfréd Rényi Institute
More informationProof of a Conjecture of Erdős on triangles in set-systems
Proof of a Conjecture of Erdős on triangles in set-systems Dhruv Mubayi Jacques Verstraëte November 11, 005 Abstract A triangle is a family of three sets A, B, C such that A B, B C, C A are each nonempty,
More informationDiscrete Mathematics
Discrete Mathematics 309 (009) 86 869 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/isc Profile vectors in the lattice of subspaces Dániel Gerbner
More informationLinear independence, a unifying approach to shadow theorems
Linear independence, a unifying approach to shadow theorems by Peter Frankl, Rényi Institute, Budapest, Hungary Abstract The intersection shadow theorem of Katona is an important tool in extremal set theory.
More informationLinear Point Sets and Rédei Type k-blocking
Journal of Algebraic Combinatorics 14 (2001), 221 228 c 2001 Kluwer Academic Publishers. Manufactured in The Netherlands. Linear Point Sets and Rédei Type k-blocking Sets in PG(n, q) L. STORME ls@cage.rug.ac.be
More informationThe Intersection Theorem for Direct Products
Europ. J. Combinatorics 1998 19, 649 661 Article No. ej9803 The Intersection Theorem for Direct Products R. AHLSWEDE, H.AYDINIAN AND L. H. KHACHATRIAN c 1998 Academic Press 1. INTRODUCTION Before we state
More informationc 2010 Society for Industrial and Applied Mathematics
SIAM J. DISCRETE MATH. Vol. 24, No. 3, pp. 1038 1045 c 2010 Society for Industrial and Applied Mathematics SET SYSTEMS WITHOUT A STRONG SIMPLEX TAO JIANG, OLEG PIKHURKO, AND ZELEALEM YILMA Abstract. A
More informationarxiv: v1 [math.co] 14 Jan 2016
The Cameron-Liebler problem for sets Maarten De Boec, Leo Storme and Andrea Švob arxiv:1601.03628v1 [math.co] 14 Jan 2016 Abstract Cameron-Liebler line classes and Cameron-Liebler -classes in PG(2 + 1,
More informationMinimal Paths and Cycles in Set Systems
Minimal Paths and Cycles in Set Systems Dhruv Mubayi Jacques Verstraëte July 9, 006 Abstract A minimal k-cycle is a family of sets A 0,..., A k 1 for which A i A j if and only if i = j or i and j are consecutive
More informationCross-Intersecting Sets of Vectors
Cross-Intersecting Sets of Vectors János Pach Gábor Tardos Abstract Given a sequence of positive integers p = (p 1,..., p n ), let S p denote the set of all sequences of positive integers x = (x 1,...,
More informationForbidding complete hypergraphs as traces
Forbidding complete hypergraphs as traces Dhruv Mubayi Department of Mathematics, Statistics, and Computer Science University of Illinois Chicago, IL 60607 Yi Zhao Department of Mathematics and Statistics
More informationChromatic Ramsey number of acyclic hypergraphs
Chromatic Ramsey number of acyclic hypergraphs András Gyárfás Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences Budapest, P.O. Box 127 Budapest, Hungary, H-1364 gyarfas@renyi.hu Alexander
More informationCodewords of small weight in the (dual) code of points and k-spaces of P G(n, q)
Codewords of small weight in the (dual) code of points and k-spaces of P G(n, q) M. Lavrauw L. Storme G. Van de Voorde October 4, 2007 Abstract In this paper, we study the p-ary linear code C k (n, q),
More informationQuadruple Systems with Independent Neighborhoods
Quadruple Systems with Independent Neighborhoods Zoltan Füredi Dhruv Mubayi Oleg Pikhurko Abstract A -graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both
More informationBetter bounds for k-partitions of graphs
Better bounds for -partitions of graphs Baogang Xu School of Mathematics, Nanjing Normal University 1 Wenyuan Road, Yadong New District, Nanjing, 1006, China Email: baogxu@njnu.edu.cn Xingxing Yu School
More informationRegular bipartite graphs and intersecting families
Journal of Combinatorial Theory, Series A 155 (2018 180 189 Contents lists available at ScienceDirect Journal of Combinatorial Theory, Series A wwwelseviercom/locate/jcta Regular bipartite graphs and intersecting
More informationNote Erdős Ko Rado from intersecting shadows
Note Erdős Ko Rado from intersecting shadows Gyula O. H. Katona Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences 1053 Budapest, Reáltanoda u. 13 15., Hungary e-mail: ohatona@renyi.hu
More informationGame saturation of intersecting families
Game saturation of intersecting families Balázs Patkós Máté Vizer November 30, 2012 Abstract We consider the following combinatorial game: two players, Fast and Slow, claim k-element subsets of [n] = {1,
More informationON LINEAR CODES WHOSE WEIGHTS AND LENGTH HAVE A COMMON DIVISOR. 1. Introduction
ON LINEAR CODES WHOSE WEIGHTS AND LENGTH HAVE A COMMON DIVISOR SIMEON BALL, AART BLOKHUIS, ANDRÁS GÁCS, PETER SZIKLAI, AND ZSUZSA WEINER Abstract. In this paper we prove that a set of points (in a projective
More informationStability of the path-path Ramsey number
Worcester Polytechnic Institute Digital WPI Computer Science Faculty Publications Department of Computer Science 9-12-2008 Stability of the path-path Ramsey number András Gyárfás Computer and Automation
More informationNonnegative k-sums, fractional covers, and probability of small deviations
Nonnegative k-sums, fractional covers, and probability of small deviations Noga Alon Hao Huang Benny Sudakov Abstract More than twenty years ago, Manickam, Miklós, and Singhi conjectured that for any integers
More informationFamilies that remain k-sperner even after omitting an element of their ground set
Families that remain k-sperner even after omitting an element of their ground set Balázs Patkós Submitted: Jul 12, 2012; Accepted: Feb 4, 2013; Published: Feb 12, 2013 Mathematics Subject Classifications:
More informationEven Cycles in Hypergraphs.
Even Cycles in Hypergraphs. Alexandr Kostochka Jacques Verstraëte Abstract A cycle in a hypergraph A is an alternating cyclic sequence A 0, v 0, A 1, v 1,..., A k 1, v k 1, A 0 of distinct edges A i and
More informationA Vector Space Analog of Lovasz s Version of the Kruskal-Katona Theorem
Claude Tardif Non-canonical Independent sets in Graph Powers Let s 4 be an integer. The truncated s-simplex T s is defined as follows: V (T s ) = {(i, j) {0, 1,..., s 1} 2 : i j}, E(T s ) = {[(i, j), (,
More informationTwo Remarks on Blocking Sets and Nuclei in Planes of Prime Order
Designs, Codes and Cryptography, 10, 9 39 (1997) c 1997 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Two Remarks on Blocking Sets and Nuclei in Planes of Prime Order ANDRÁS GÁCS
More informationOn decompositions of complete hypergraphs
On decompositions of complete hypergraphs Sebastian M Cioabă 1, Department of Mathematical Sciences, University of Delaware, Newar, DE 19716, USA André Kündgen Department of Mathematics, California State
More informationOn the stability of small blocking sets
J Algebr Comb (04) 40:79 9 DOI 0.007/s080-03-0487-0 On the stability of small blocking sets Tamás Szőnyi Zsuzsa Weiner Received: April 0 / Accepted: 6 November 03 / Published online: 3 December 03 Springer
More informationAbout Maximal Partial 2-Spreads in PG(3m 1, q)
Innovations in Incidence Geometry Volume 00 (XXXX), Pages 000 000 ISSN 1781-6475 About Maximal Partial 2-Spreads in PG(3m 1, q) Sz. L. Fancsali and P. Sziklai Abstract In this article we construct maximal
More informationChoosability and fractional chromatic numbers
Choosability and fractional chromatic numbers Noga Alon Zs. Tuza M. Voigt This copy was printed on October 11, 1995 Abstract A graph G is (a, b)-choosable if for any assignment of a list of a colors to
More informationA spectrum result on minimal blocking sets with respect to the planes of PG(3, q), q odd
A spectrum result on minimal blocking sets with respect to the planes of PG(3, q), q odd C. Rößing L. Storme January 12, 2010 Abstract This article presents a spectrum result on minimal blocking sets with
More informationPartitioning 2-edge-colored Ore-type graphs by monochromatic cycles
Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles János Barát MTA-ELTE Geometric and Algebraic Combinatorics Research Group barat@cs.elte.hu and Gábor N. Sárközy Alfréd Rényi Institute
More informationSaturating sets in projective planes and hypergraph covers
Saturating sets in projective planes and hypergraph covers Zoltán Lóránt Nagy MTA ELTE Geometric and Algebraic Combinatorics Research Group H 7 Budapest, Pázmány P sétány /C, Hungary nagyzoli@cseltehu
More informationA Hilton-Milner-type theorem and an intersection conjecture for signed sets
A Hilton-Milner-type theorem and an intersection conjecture for signed sets Peter Borg Department of Mathematics, University of Malta Msida MSD 2080, Malta p.borg.02@cantab.net Abstract A family A of sets
More informationLarge incidence-free sets in geometries
Large incidence-free sets in geometries Stefaan De Winter Department of Mathematical Sciences Michigan Technological University Michigan, U.S.A. Jeroen Schillewaert sgdewint@mtu.edu Jacques Verstraete
More informationStar Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp
Combinatorics, Probability and Computing (2012) 21, 179 186. c Cambridge University Press 2012 doi:10.1017/s096358311000599 Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp ANDRÁS GYÁRFÁS1
More informationA necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees Yoshimi Egawa Department of Mathematical Information Science, Tokyo University of
More informationOn the number of cycles in a graph with restricted cycle lengths
On the number of cycles in a graph with restricted cycle lengths Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós arxiv:1610.03476v1 [math.co] 11 Oct 2016 October 12, 2016 Abstract Let L be a
More informationGame saturation of intersecting families
Cent. Eur. J. Math. 129) 2014 1382-1389 DOI: 10.2478/s11533-014-0420-3 Central European Journal of Mathematics Game saturation of intersecting families Research Article Balázs Patkós 1, Máté Vizer 1 1
More informationMaximum union-free subfamilies
Maximum union-free subfamilies Jacob Fox Choongbum Lee Benny Sudakov Abstract An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called
More informationKatarzyna Mieczkowska
Katarzyna Mieczkowska Uniwersytet A. Mickiewicza w Poznaniu Erdős conjecture on matchings in hypergraphs Praca semestralna nr 1 (semestr letni 010/11 Opiekun pracy: Tomasz Łuczak ERDŐS CONJECTURE ON MATCHINGS
More informationAn improvement on the maximum number of k-dominating Independent Sets
An improvement on the maximum number of -Dominating Independent Sets arxiv:709.0470v [math.co] 4 Sep 07 Dániel Gerbner a Balázs Keszegh a Abhishe Methuu b Balázs Patós a September 5, 07 Máté Vizer a a
More informationHanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS
Opuscula Mathematica Vol. 6 No. 006 Hanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS Abstract. A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a
More informationRainbow Hamilton cycles in uniform hypergraphs
Rainbow Hamilton cycles in uniform hypergraphs Andrzej Dude Department of Mathematics Western Michigan University Kalamazoo, MI andrzej.dude@wmich.edu Alan Frieze Department of Mathematical Sciences Carnegie
More informationThe maximum size of a partial spread in H(4n + 1,q 2 ) is q 2n+1 + 1
The maximum size of a partial spread in H(4n +, 2 ) is 2n+ + Frédéric Vanhove Dept. of Pure Mathematics and Computer Algebra, Ghent University Krijgslaan 28 S22 B-9000 Ghent, Belgium fvanhove@cage.ugent.be
More informationErdös-Ko-Rado theorems for chordal and bipartite graphs
Erdös-Ko-Rado theorems for chordal and bipartite graphs arxiv:0903.4203v2 [math.co] 15 Jul 2009 Glenn Hurlbert and Vikram Kamat School of Mathematical and Statistical Sciences Arizona State University,
More informationOn (δ, χ)-bounded families of graphs
On (δ, χ)-bounded families of graphs András Gyárfás Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, P.O. Box 63 Budapest, Hungary, H-1518 gyarfas@sztaki.hu Manouchehr
More informationCodegree problems for projective geometries
Codegree problems for projective geometries Peter Keevash Yi Zhao Abstract The codegree density γ(f ) of an r-graph F is the largest number γ such that there are F -free r-graphs G on n vertices such that
More information4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu**
4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN Robin Thomas* Xingxing Yu** School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332, USA May 1991, revised 23 October 1993. Published
More informationarxiv: v1 [math.co] 6 Jan 2017
Domination in intersecting hypergraphs arxiv:70.0564v [math.co] 6 Jan 207 Yanxia Dong, Erfang Shan,2, Shan Li, Liying Kang Department of Mathematics, Shanghai University, Shanghai 200444, P.R. China 2
More informationarxiv: v1 [math.co] 28 Jan 2019
THE BROWN-ERDŐS-SÓS CONJECTURE IN FINITE ABELIAN GROUPS arxiv:191.9871v1 [math.co] 28 Jan 219 JÓZSEF SOLYMOSI AND CHING WONG Abstract. The Brown-Erdős-Sós conjecture, one of the central conjectures in
More informationOn disjoint common bases in two matroids
Egerváry Research Group on Combinatorial Optimization Technical reports TR-2010-10. Published by the Egerváry Research Group, Pázmány P. sétány 1/C, H 1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.
More informationOn judicious bipartitions of graphs
On judicious bipartitions of graphs Jie Ma Xingxing Yu Abstract For a positive integer m, let fm be the maximum value t such that any graph with m edges has a bipartite subgraph of size at least t, and
More informationSize and degree anti-ramsey numbers
Size and degree anti-ramsey numbers Noga Alon Abstract A copy of a graph H in an edge colored graph G is called rainbow if all edges of H have distinct colors. The size anti-ramsey number of H, denoted
More informationNon-trivial intersecting uniform sub-families of hereditary families
Non-trivial intersecting uniform sub-families of hereditary families Peter Borg Department of Mathematics, University of Malta, Msida MSD 2080, Malta p.borg.02@cantab.net April 4, 2013 Abstract For a family
More informationVERTEX DEGREE SUMS FOR PERFECT MATCHINGS IN 3-UNIFORM HYPERGRAPHS
VERTEX DEGREE SUMS FOR PERFECT MATCHINGS IN 3-UNIFORM HYPERGRAPHS YI ZHANG, YI ZHAO, AND MEI LU Abstract. We determine the minimum degree sum of two adjacent vertices that ensures a perfect matching in
More informationIrredundant Families of Subcubes
Irredundant Families of Subcubes David Ellis January 2010 Abstract We consider the problem of finding the maximum possible size of a family of -dimensional subcubes of the n-cube {0, 1} n, none of which
More informationExcluded permutation matrices and the Stanley Wilf conjecture
Excluded permutation matrices and the Stanley Wilf conjecture Adam Marcus Gábor Tardos November 2003 Abstract This paper examines the extremal problem of how many 1-entries an n n 0 1 matrix can have that
More informationErdős-Ko-Rado theorems in polar spaces
Singapore, May 2016 The theorem of Erdős-Ko-Rado Theorem, 1961: If S is an intersecting family of k-subsets of an n-set Ω, n 2k, then S ( n 1 k 1). For n 2k + 1 equality holds iff S consists of all k-subsets
More informationAn algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings
Also available at http://amc-journal.eu ISSN 855-3966 (printed edn.), ISSN 855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 2 (207) 205 27 An algebraic proof of the Erdős-Ko-Rado theorem for intersecting
More information1 The Erdős Ko Rado Theorem
1 The Erdős Ko Rado Theorem A family of subsets of a set is intersecting if any two elements of the family have at least one element in common It is easy to find small intersecting families; the basic
More informationBalanced bipartitions of graphs
2010.7 - Dedicated to Professor Feng Tian on the occasion of his 70th birthday Balanced bipartitions of graphs Baogang Xu School of Mathematical Science, Nanjing Normal University baogxu@njnu.edu.cn or
More informationIMA Preprint Series # 2385
LIST COLORINGS WITH DISTINCT LIST SIZES, THE CASE OF COMPLETE BIPARTITE GRAPHS By Zoltán Füredi and Ida Kantor IMA Preprint Series # 2385 ( October 2011 ) INSTITUTE FOR MATHEMATICS AND ITS APPLICATIONS
More informationNew lower bounds for hypergraph Ramsey numbers
New lower bounds for hypergraph Ramsey numbers Dhruv Mubayi Andrew Suk Abstract The Ramsey number r k (s, n) is the minimum N such that for every red-blue coloring of the k-tuples of {1,..., N}, there
More informationThe 2-blocking number and the upper chromatic number of PG(2, q)
The 2-blocking number and the upper chromatic number of PG(2, q) Tamás Szőnyi Joint work with Gábor Bacsó and Tamás Héger Eötvös Loránd University, MTA-ELTE GAC Research Group and Ghent University Budapest
More informationWelsh s problem on the number of bases of matroids
Welsh s problem on the number of bases of matroids Edward S. T. Fan 1 and Tony W. H. Wong 2 1 Department of Mathematics, California Institute of Technology 2 Department of Mathematics, Kutztown University
More informationThe cocycle lattice of binary matroids
Published in: Europ. J. Comb. 14 (1993), 241 250. The cocycle lattice of binary matroids László Lovász Eötvös University, Budapest, Hungary, H-1088 Princeton University, Princeton, NJ 08544 Ákos Seress*
More informationNorm-graphs: variations and applications
Norm-graphs: variations and applications Noga Alon 1 School of Mathematics, Institute for Advanced Study Olden Lane, Princeton, NJ 08540 and Department of Mathematics, Tel Aviv University Tel Aviv, Israel
More informationEquitable Colorings of Corona Multiproducts of Graphs
Equitable Colorings of Corona Multiproducts of Graphs arxiv:1210.6568v1 [cs.dm] 24 Oct 2012 Hanna Furmańczyk, Marek Kubale Vahan V. Mkrtchyan Abstract A graph is equitably k-colorable if its vertices can
More informationRainbow Hamilton cycles in uniform hypergraphs
Rainbow Hamilton cycles in uniform hypergraphs Andrzej Dude Department of Mathematics Western Michigan University Kalamazoo, MI andrzej.dude@wmich.edu Alan Frieze Department of Mathematical Sciences Carnegie
More informationThe Lefthanded Local Lemma characterizes chordal dependency graphs
The Lefthanded Local Lemma characterizes chordal dependency graphs Wesley Pegden March 30, 2012 Abstract Shearer gave a general theorem characterizing the family L of dependency graphs labeled with probabilities
More informationarxiv: v1 [math.co] 18 Dec 2018
A Construction for Difference Sets with Local Properties Sara Fish Ben Lund Adam Sheffer arxiv:181.07651v1 [math.co] 18 Dec 018 Abstract We construct finite sets of real numbers that have a small difference
More informationAn algorithm to increase the node-connectivity of a digraph by one
Discrete Optimization 5 (2008) 677 684 Contents lists available at ScienceDirect Discrete Optimization journal homepage: www.elsevier.com/locate/disopt An algorithm to increase the node-connectivity of
More informationOn set systems with a threshold property
On set systems with a threshold property Zoltán Füredi 1 Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA, and Rényi Institute of Mathematics of the Hungarian
More informationAALBORG UNIVERSITY. Total domination in partitioned graphs. Allan Frendrup, Preben Dahl Vestergaard and Anders Yeo
AALBORG UNIVERSITY Total domination in partitioned graphs by Allan Frendrup, Preben Dahl Vestergaard and Anders Yeo R-2007-08 February 2007 Department of Mathematical Sciences Aalborg University Fredrik
More informationThe number of edge colorings with no monochromatic cliques
The number of edge colorings with no monochromatic cliques Noga Alon József Balogh Peter Keevash Benny Sudaov Abstract Let F n, r, ) denote the maximum possible number of distinct edge-colorings of a simple
More informationProbabilistic Method. Benny Sudakov. Princeton University
Probabilistic Method Benny Sudakov Princeton University Rough outline The basic Probabilistic method can be described as follows: In order to prove the existence of a combinatorial structure with certain
More informationAhlswede Khachatrian Theorems: Weighted, Infinite, and Hamming
Ahlswede Khachatrian Theorems: Weighted, Infinite, and Hamming Yuval Filmus April 4, 2017 Abstract The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum cardinality of
More informationSUMSETS AND THE CONVEX HULL MÁTÉ MATOLCSI AND IMRE Z. RUZSA
SUMSETS AND THE CONVEX HULL MÁTÉ MATOLCSI AND IMRE Z RUZSA Abstract We extend Freiman s inequality on the cardinality of the sumset of a d dimensional set We consider different sets related by an inclusion
More informationGroup connectivity of certain graphs
Group connectivity of certain graphs Jingjing Chen, Elaine Eschen, Hong-Jian Lai May 16, 2005 Abstract Let G be an undirected graph, A be an (additive) Abelian group and A = A {0}. A graph G is A-connected
More informationSQUARES AND DIFFERENCE SETS IN FINITE FIELDS
SQUARES AND DIFFERENCE SETS IN FINITE FIELDS C. Bachoc 1 Univ Bordeaux, Institut de Mathématiques de Bordeaux, 351, cours de la Libération 33405, Talence cedex, France bachoc@math.u-bordeaux1.fr M. Matolcsi
More informationErdős-Ko-Rado theorems on the weak Bruhat lattice
Erdős-Ko-Rado theorems on the weak Bruhat lattice Susanna Fishel, Glenn Hurlbert, Vikram Kamat, Karen Meagher December 14, 2018 Abstract Let L = (X, ) be a lattice. For P X we say that P is t-intersecting
More informationAsymptotically optimal induced universal graphs
Asymptotically optimal induced universal graphs Noga Alon Abstract We prove that the minimum number of vertices of a graph that contains every graph on vertices as an induced subgraph is (1 + o(1))2 (
More informationVariants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems
Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems Dhruv Mubayi December 19, 2016 Abstract Given integers l, n, the lth power of the path P n is the ordered graph Pn l with vertex set v 1
More informationThe chromatic covering number of a graph
The chromatic covering number of a graph Reza Naserasr a Claude Tardif b May 7, 005 a: Department of Mathematics, Simon Fraser University, Burnaby BC, V5A 1S6, Canada. Current address: Department of Combinatorics
More informationTHE LARGEST INTERSECTION LATTICE OF A CHRISTOS A. ATHANASIADIS. Abstract. We prove a conjecture of Bayer and Brandt [J. Alg. Combin.
THE LARGEST INTERSECTION LATTICE OF A DISCRIMINANTAL ARRANGEMENT CHRISTOS A. ATHANASIADIS Abstract. We prove a conjecture of Bayer and Brandt [J. Alg. Combin. 6 (1997), 229{246] about the \largest" intersection
More informationThe Interlace Polynomial of Graphs at 1
The Interlace Polynomial of Graphs at 1 PN Balister B Bollobás J Cutler L Pebody July 3, 2002 Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152 USA Abstract In this paper we
More informationRelating minimum degree and the existence of a k-factor
Relating minimum degree and the existence of a k-factor Stephen G Hartke, Ryan Martin, and Tyler Seacrest October 6, 010 Abstract A k-factor in a graph G is a spanning regular subgraph in which every vertex
More informationInequalities for the First-Fit chromatic number
Worcester Polytechnic Institute Digital WPI Computer Science Faculty Publications Department of Computer Science 9-007 Inequalities for the First-Fit chromatic number Zoltán Füredi Alfréd Rényi Institute,
More informationJournal of Discrete Mathematical Sciences & Cryptography Vol. 9 (2006), No. 1, pp
Some generalizations of Rédei s theorem T. Alderson Department of Mathematical Sciences University of New Brunswick Saint John, New Brunswick Canada EL 4L5 Abstract By the famous theorems of Rédei, a set
More informationOn the single-orbit conjecture for uncoverings-by-bases
On the single-orbit conjecture for uncoverings-by-bases Robert F. Bailey School of Mathematics and Statistics Carleton University 1125 Colonel By Drive Ottawa, Ontario K1S 5B6 Canada Peter J. Cameron School
More informationInduced subgraphs of prescribed size
Induced subgraphs of prescribed size Noga Alon Michael Krivelevich Benny Sudakov Abstract A subgraph of a graph G is called trivial if it is either a clique or an independent set. Let q(g denote the maximum
More information10.4 The Kruskal Katona theorem
104 The Krusal Katona theorem 141 Example 1013 (Maximum weight traveling salesman problem We are given a complete directed graph with non-negative weights on edges, and we must find a maximum weight Hamiltonian
More information#A45 INTEGERS 9 (2009), BALANCED SUBSET SUMS IN DENSE SETS OF INTEGERS. Gyula Károlyi 1. H 1117, Hungary
#A45 INTEGERS 9 (2009, 591-603 BALANCED SUBSET SUMS IN DENSE SETS OF INTEGERS Gyula Károlyi 1 Institute of Mathematics, Eötvös University, Pázmány P. sétány 1/C, Budapest, H 1117, Hungary karolyi@cs.elte.hu
More informationProbabilistic Proofs of Existence of Rare Events. Noga Alon
Probabilistic Proofs of Existence of Rare Events Noga Alon Department of Mathematics Sackler Faculty of Exact Sciences Tel Aviv University Ramat-Aviv, Tel Aviv 69978 ISRAEL 1. The Local Lemma In a typical
More informationCharacterizations of the finite quadric Veroneseans V 2n
Characterizations of the finite quadric Veroneseans V 2n n J. A. Thas H. Van Maldeghem Abstract We generalize and complete several characterizations of the finite quadric Veroneseans surveyed in [3]. Our
More informationStrong Turán stability
Available online at www.sciencedirect.com www.elsevier.com/locate/endm Strong Turán stability Mykhaylo Tyomkyn 1,2 School of Mathematics University of Birmingham Birmingham B15 2TT, United Kingdom Andrew
More information