Title:
Braces and Pfaffian Orientations
Braces and Pfaffian Orientations
dc.contributor.author | Whalen, Peter | |
dc.date.accessioned | 2012-07-07T16:57:13Z | |
dc.date.available | 2012-07-07T16:57:13Z | |
dc.date.issued | 2012-05 | |
dc.description | Proceedings of Graph Theory@Georgia Tech, a conference honoring the 50th Birthday of Robin Thomas, May 7-11, 2012 in the Clough Undergraduate Learning Commons. | en_US |
dc.description.abstract | Robertson, Seymour, Thomas and simultaneously McCuaig answered several equivalent questions. Specifically, when can some of the 1's of a 0-1 square matrix, A, be changed to -1's so that the permanent of A equals the determinant of the modified matrix? When is a hypergraph with n vertices and n hyperedges minimally nonbipartite? When does a bipartite graph have a Pfaffian orientation? Given a digraph, does it have an even directed circuit? When is a square matrix sign non-singular? We provide a much shorter proof using elementary methods for their theorem. This is joint work with Robin Thomas. | en_US |
dc.description.sponsorship | NSF, NSA, ONR, IMA, Colleges of Sciences, Computing and Engineering | en_US |
dc.identifier.uri | http://hdl.handle.net/1853/44227 | |
dc.language.iso | en_US | en_US |
dc.publisher | Georgia Institute of Technology | en_US |
dc.subject | Pfaffian orientation | en_US |
dc.title | Braces and Pfaffian Orientations | en_US |
dc.type | Text | |
dc.type.genre | Proceedings | |
dspace.entity.type | Publication | |
local.contributor.corporatename | College of Sciences | |
local.contributor.corporatename | School of Mathematics | |
local.relation.ispartofseries | Graph Theory @ Georgia Tech | |
relation.isOrgUnitOfPublication | 85042be6-2d68-4e07-b384-e1f908fae48a | |
relation.isOrgUnitOfPublication | 84e5d930-8c17-4e24-96cc-63f5ab63da69 | |
relation.isSeriesOfPublication | b4422082-53fd-4ec1-a662-cefcfd38ab03 |
Files
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.76 KB
- Format:
- Item-specific license agreed upon to submission
- Description: