Killing a Vortex
Abstract
References
Recommendations
A generalization of Little's Theorem on Pfaffian orientations
Little (1975) [12] showed that, in a certain sense, the only minimal non-Pfaffian bipartite matching covered graph is the brace K"3","3. Using a stronger notion of minimality than the one used by Little, we show that every minimal non-Pfaffian brick G ...
Note: Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge density
It is proved that for all positive integers d,k,s,t with t>=k+1 there is a positive integer M=M(d,k,s,t) such that every graph with edge density at least d+k and at least M vertices contains a k-connected subgraph on at least t vertices, or s pairwise ...
Det-extremal cubic bipartite graphs
Let G be a connected k–regular bipartite graph with bipartition V(G) = X ∪ Y and adjacency matrix A. We say G is det-extremal if per (A) = |det(A)|. Det–extremal k–regular bipartite graphs exist only for k = 2 or 3. McCuaig has characterized the det-...
Comments
Information & Contributors
Information
Published In
![cover image Journal of the ACM](/cms/asset/bb137843-2e45-402b-a2d2-bb25d5f831fc/3613647.cover.jpg)
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- ANR projects DEMOGRAPH
- ESIGMA
- French-German Collaboration ANR/DFG Project UTMA
- Institute for Basic Science
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 82Total Downloads
- Downloads (Last 12 months)82
- Downloads (Last 6 weeks)37
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in