CPC 2006 - PDF Preprint Papers

CPC 2006

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CPC-2006 Paper

click to vote

CPC
2006

132views more CPC 2006»

Duality in Infinite Graphs

14 years 14 days ago

Download www.math.uni-hamburg.de

The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cuts (or cocycles) can be infinite, cycles are finite. We show that these obstruc...

Henning Bruhn, Reinhard Diestel

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	132	Duality in Infinite Graphs	claim
2	122	Absence of Zeros for the Chromatic Polynomial on Bounded Degree Graphs	claim
3	116	Finding Large Independent Sets in Polynomial Expected Time	claim
4	110	Bootstrap Percolation on Infinite Trees and Non-Amenable Groups	claim
5	110	Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time	claim
6	102	Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs	claim
7	97	Homomorphism-Homogeneous Relational Structures	claim
8	93	Generating Outerplanar Graphs Uniformly at Random	claim
9	93	Distribution of Vertex Degree in Web-Graphs	claim
10	92	Increments of Random Partitions	claim
11	92	Waiting for a Bat to Fly By (in Polynomial Time)	claim
12	91	On the Independent Domination Number of Random Regular Graphs	claim
13	84	Splitter Theorems for Cubic Graphs	claim
14	80	An Upper Bound for Constrained Ramsey Numbers	claim
15	79	On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids	claim
16	78	Arithmetic Progressions in Sets with Small Sumsets	claim
17	74	Blocking Conductance and Mixing in Random Walks	claim
18	73	Feasible Schedules for Rotating Transmissions	claim
19	72	Parametrized Tutte Polynomials of Graphs and Matroids	claim
20	72	On Dependency Graphs and the Lattice Gas	claim
21	69	Size and Weight of Shortest Path Trees with Exponential Link Weights	claim
22	62	Autocorrelations of Random Binary Sequences	claim
23	62	The Tutte Polynomial for Matroids of Bounded Branch-Width	claim
24	56	Rayleigh Matroids	claim
25	56	A Tale of Three Couplings: Poisson-Dirichlet and GEM Approximations for Random Permutations	claim
26	55	A Multidimensional Central Sets Theorem	claim
27	55	On Graph Complexity	claim
28	53	Simulating a Random Walk with Constant Error	claim
29	45	Balanced Signings and the Chromatic Number of Oriented Matroids	claim
30	37	Measures of Pseudorandomness for Finite Sequences: Minimal Values	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers