The Number of Solutions Sufficient for Solving a Family of Problems

References

• Alon N., Babai L., Suzuki H. Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems. J. Combin. Theory A (1991) 58:165–180Crossref, Google Scholar
• Babai L., Frankl P. Linear algebra methods in combinatorics. (1992) . Preliminary Version 2. Department of Computer Science, The University of Chicago, Chicago, ILGoogle Scholar
• Bartholdi J. J. A good matrix is hard to find. Oper. Res. Lett. (1982) 5:190–193Crossref, Google Scholar
• Cheng C. K., Hu T. C., Kannan R., Pulleyblank W. R. Ancestor tree for arbitrary multi-terminal cut functions. Proc. 1st Integer Programming Combin. Optim. Conf. (1990) (University of Waterloo Press, Waterloo, Ontario, Canada) 115–127Google Scholar
• Eilam-Tzoreff T. Disjoint paths in graphs with additional constraints. (1996) . Ph.D. dissertation, Tel Aviv University, Tel Aviv, IsraelGoogle Scholar
• Frankl P. An extremal problem for two families of sets. Eur. J. Combin. (1982) 3:125–127Crossref, Google Scholar
• Frankl P. Intersection theorems and mod p rank of inclusion matrices. J. Combin. Theory Series A (1990) 54:85–94Crossref, Google Scholar
• Frumkin A., Yakir A. Rank of inclusion matrices and modular representation theory. Israel J. Math. (1990) 71(3):309–320Crossref, Google Scholar
• Gomory R. E., Hu T. C. Multi-terminal network flows. J. SIAM (1961) 9:551–570Google Scholar
• Hartvigsen D. Compact representation of cuts. SIAM J. Discrete Math. (2001) 14(1):49–66Crossref, Google Scholar
• Hassin R. Solution bases of multiterminal cut problems. Math. Oper. Res. (1988) 13:535–542Link, Google Scholar
• Hassin R. An algorithm for computing maximum solution bases. Oper. Res. Lett. (1990) 9:315–318Crossref, Google Scholar
• Hassin R. Multiterminal xcut problems. Ann. Oper. Res. (1991) 33:215–225Crossref, Google Scholar
• Jukna S.Extremal Combinatorics (2002) (Springer, Berlin, Germany) Google Scholar
• Linial N., Rothschild B. L. Incidence matrices of subsets—A rank formula. SIAM J. Algebraic Discrete Methods (1981) 2(4):333–340Crossref, Google Scholar
• Lovász L. Topological and algebraic methods in graph theory. Graph Theory and Related Topics (1979) (Academic Press, New-York, London, UK) 1–14Google Scholar
• Parekh O. Forestation in hypergraphs: Linear k-trees. Electronic J. Combin. (2003) 10(1Google Scholar
• Razborov A. A. Lower bounds on the size of bounded-depth network over a complete basis with logical addition. Math. Notes Acad. Sci. USSR (1987) 41(4):333–338Google Scholar
• Wilson R. M. A diagonal form for the incidence matrices of t-subsets vs. k-subsets. Eur. J. Combin. (1990) 11:609–615Crossref, Google Scholar