Halin’s End Degree Conjecture
نویسندگان
چکیده
An end of a graph G is an equivalence class rays, where two rays are equivalent if there infinitely many vertex-disjoint paths between them in G. The degree the maximum cardinality collection pairwise disjoint this class.
منابع مشابه
Rao's degree sequence conjecture
Let us say two (simple) graphs G,G′ are degree-equivalent if they have the same vertex set, and for every vertex, its degrees in G and in G′ are equal. In the early 1980’s, S. B. Rao made the conjecture that in any infinite set of graphs, there exist two of them, say G and H, such that H is isomorphic to an induced subgraph of some graph that is degree-equivalent to G. We prove this conjecture.
متن کاملHoffmann’s Conjecture for Totally Singular Forms of Prime Degree
One of the most significant discrete invariants of a quadratic form φ over a field k is its (full) splitting pattern, a finite sequence of integers which describes the possible isotropy behaviour of φ under scalar extension to arbitrary overfields of k. A similarly important, but more accessible variant of this notion is that of the Knebusch splitting pattern of φ, which captures the isotropy b...
متن کاملThe Strong Novikov Conjecture for Low Degree Cohomology
We show that for each discrete group Γ, the rational assembly map K∗(BΓ)⊗Q→ K∗(C maxΓ)⊗Q is injective on classes dual to Λ∗ ⊂ H∗(BΓ;Q), where Λ∗ is the subring generated by cohomology classes of degree at most 2. Our result implies homotopy invariance of higher signatures associated to classes in Λ∗. This consequence was first established by Connes-Gromov-Moscovici [4] and Mathai [9]. Our appro...
متن کاملArtin’s Conjecture for Forms of Degree 7 and 11
A fundamental aspect of the study of Diophantine equations is that of determining when an equation has a local solution. Artin once conjectured (see the preface to [1]) that if k is a complete, discretely valued field with finite residue class field, then every homogeneous form of degree d in greater than d # variables whose coefficients are integers of k has a nontrivial zero. In this paper, w...
متن کاملVizing's 2-Factor Conjecture Involving Large Maximum Degree
Let G be a simple graph of order n, and let ∆(G) and χ′(G) denote the maximum degree and chromatic index of G, respectively. Vizing proved that χ′(G) = ∆(G) or ∆(G) + 1. Following this result, G is called edge-chromatic critical if χ′(G) = ∆(G) + 1 and χ′(G − e) = ∆(G) for every e ∈ E(G). In 1968, Vizing conjectured that if G is edge-chromatic critical, then the independence number α(G) ≤ n/2, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Trends in mathematics
سال: 2021
ISSN: ['2297-024X', '2297-0215']
DOI: https://doi.org/10.1007/978-3-030-83823-2_13