| Full text | |
| Author(s): |
Lemos‚ M.
;
Melo‚ TRB
Total Authors: 2
|
| Document type: | Journal article |
| Source: | DISCRETE APPLIED MATHEMATICS; v. 156, n. 7, p. 1019-1024, 2008. |
| Abstract | |
In this note, we obtain a lower bound for the number of connected hyperplanes of a 3-connected binary matroid M containing a fixed set A provided M vertical bar A is coloopless. (C) 2007 Elsevier B.V. All tights reserved. (AU) | |
| FAPESP's process: | 03/09925-5 - Foundations of computer science: combinatory algorithms and discrete structures |
| Grantee: | Yoshiharu Kohayakawa |
| Support Opportunities: | PRONEX Research - Thematic Grants |