Searching for "G-Intersecting Families." – sorted by Relevance.
-
A Polynomial Algorithm for the Strong Helly Property
- holds for any triangle in G. Let fE 1 ; E 2 ; E 3 g be an intersecting family. Hence there are vertices
- Cited by 1 (0 self) – Add To MetaCart
-
Acknowledgment
- that the maximum size of 43-uniform f0; 1; 7g-intersecting family is O(n2). An interesting question is whether
- Add To MetaCart
-
Jin Qian and Dijen K. Ray-Chaudhuri
- + k \Gamma 1g-intersection family. Then jF j jX k j + jX k\Gamma2 j + \Delta \Delta \Delta + jX k
- Add To MetaCart
-
Structure and Stability of Triangle-free set systems
- r and let G⊂ � � X r be an intersecting family. Then |G| ≤ � � n−1 r−1 .Ifn>2r and equality holds
- Cited by 6 (5 self) – Add To MetaCart
-
Bounds on Pairs of Families with Restricted Intersections
- . Hence Conjecture 6.2 implies that any fk; k+1g-intersecting family has size at most 2 (log r) O(1
- Cited by 4 (0 self) – Add To MetaCart
-
Synthesizing Distributed Transition Systems From Global Specifications
- fb j 1 ; : : : ; b j k g be the intersection family, given by q b j i q 0 , q j i q 0 q j 0 i
- Cited by 9 (0 self) – Add To MetaCart

