Hamilton cycles,avoiding prescribed arcs,in close-to-regular tournaments

The local irregularity of a digraph D is defined as i_l(D) = max {|d⁺ (x) − d⁻ (x)| : x ϵ V(D)}. Let T be a tournament, let Γ = {V₁, V₂, …, V_c} be a partition of V(T) such that |V₁| ≥ |V₂| ≥ … ≥ |V_c|, and let D be the multipartite tournament obtained by deleting all the arcs with both end points in the same set in Γ. We prove that, if |V(T)| ≥ max{2i_l(T) + 2|V₁| + 2|V₂| − 2, i_l(T) + 3|V₁| − 1}, then D is Hamiltonian. Furthermore, if T is regular (i.e., i_l(T) = 0), then we state slightly better lower bounds for |V(T)| such that we still can guarantee that D is Hamiltonian. Finally, we show that our results are best possible. © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 123–136, 1999     

Quadrilaterals,extremal quasiconformal extensions and Hamilton sequences

The relationship between Strebel boundary dilatation of a quasisymmetric function h of the unit circle and the dilatation indicated by the change in the modules of the quadrilaterals with vertices on the circle intrigues many mathematicians. It had been a conjecture for some time that the dilatations Ko（h） and K1（h） of h are equal before Anderson and Hinkkanen disproved this by constructing concrete counterexamples. The independent work of Wu and of Yang completely characterizes the condition for Ko（h） = K1 （h） when h has no substantial boundary point. In this paper, we give a necessary and sufficient condition to determine the equality for h admitting a substantial boundary point.     

Hamilton cycles in quasirandom hypergraphs

We show that, for a natural notion of quasirandomness in k‐uniform hypergraphs, any quasirandom k‐uniform hypergraph on n vertices with constant edge density and minimum vertex degree Ω(n^k‐1) contains a loose Hamilton cycle. We also give a construction to show that a k‐uniform hypergraph satisfying these conditions need not contain a Hamilton ?‐cycle if k– ? divides k. The remaining values of ? form an interesting open question. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 49, 363–378, 2016     

Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs

We show that for every there exists C > 0 such that if then asymptotically almost surely the random graph contains the k^th power of a Hamilton cycle. This determines the threshold for appearance of the square of a Hamilton cycle up to the logarithmic factor, improving a result of Kühn and Osthus. Moreover, our proof provides a randomized quasi‐polynomial algorithm for finding such powers of cycles. Using similar ideas, we also give a randomized quasi‐polynomial algorithm for finding a tight Hamilton cycle in the random k‐uniform hypergraph for . The proofs are based on the absorbing method and follow the strategy of Kühn and Osthus, and Allen et al. The new ingredient is a general Connecting Lemma which allows us to connect tuples of vertices using arbitrary structures at a nearly optimal value of p. Both the Connecting Lemma and its proof, which is based on Janson's inequality and a greedy embedding strategy, might be of independent interest.     

Hamilton cycles in claw-heavy graphs

A graph G on n≥3 vertices is called claw-heavy if every induced claw (K_1,3) of G has a pair of nonadjacent vertices such that their degree sum is at least n. In this paper we show that a claw-heavy graph G has a Hamilton cycle if we impose certain additional conditions on G involving numbers of common neighbors of some specific pair of nonadjacent vertices, or forbidden induced subgraphs. Our results extend two previous theorems of Broersma, Ryjá?ek and Schiermeyer [H.J. Broersma, Z. Ryjá?ek, I. Schiermeyer, Dirac’s minimum degree condition restricted to claws, Discrete Math. 167-168 (1997) 155-166], on the existence of Hamilton cycles in 2-heavy graphs.     

Loose Hamilton cycles in hypergraphs

We prove that any k-uniform hypergraph on n vertices with minimum degree at least contains a loose Hamilton cycle. The proof strategy is similar to that used by Kühn and Osthus for the 3-uniform case. Though some additional difficulties arise in the k-uniform case, our argument here is considerably simplified by applying the recent hypergraph blow-up lemma of Keevash.     

Packing,counting and covering Hamilton cycles in random directed graphs

In this paper we study the chaotic behavior of the heat semigroup generated by the Dunkl-Laplacian on weighted L ^p spaces. In the case of the heat semigroup associated to the standard Laplacian we obtain a complete picture on the spaces L ^p (R ⁿ , (φ _iρ (x))² dx) where φ _iρ is the Euclidean spherical function. The behavior is very similar to the case of the Laplace–Beltrami operator on non-compact Riemannian symmetric spaces studied by Pramanik and Sarkar.     

Planar graphs,Hamilton cycles and extreme independence number

If a graph has too many edges, it must be Hamiltonian. We show how to construct graphs near the threshold: they have as many edges as possible without sacrificing planarity but are not Hamiltonian. We base our construction on the concepts of independent sets and 1-toughness.The work of the author was partially supported by CNPq-Brasil.     

Tight Hamilton cycles in random hypergraphs

We give an algorithmic proof for the existence of tight Hamilton cycles in a random r‐uniform hypergraph with edge probability for every . This partly answers a question of Dudek and Frieze (Random Struct Algor 42 (2013), 374–385), who used a second moment method to show that tight Hamilton cycles exist even for where arbitrary slowly, and for . The method we develop for proving our result applies to related problems as well. © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 46, 446–465, 2015     

Hamilton cycles in restricted block-intersection graphs

As part of our main result we prove that the blocks of any sufficiently large BIBD(v, 4, λ) can be circularly ordered so that consecutive blocks intersect in exactly one point, i.e., that the 1-block-intersection graphs of such designs are Hamiltonian. In fact, we prove that such graphs are Hamilton-connected. We also consider {1, 2}-block-intersection graphs, in which adjacent vertices have either one or two points in common between their corresponding blocks. These graphs are Hamilton-connected for all sufficiently large BIBD(v, k, λ) with \({k \in \{4,5,6\}}\).     

Edge disjoint Hamilton cycles in graphs

Let G be a graph of order n and k ≥ 0 an integer. It is conjectured in [8] that if for any two vertices u and v of a 2(k + 1)‐connected graph G,d _G (u,v) = 2 implies that max{d(u;G), d(v;G)} ≥ (n/2) + 2k, then G has k + 1 edge disjoint Hamilton cycles. This conjecture is true for k = 0, 1 (see cf. [3] and [8]). It will be proved in this paper that the conjecture is true for every integer k ≥ 0. © 2000 John Wiley & Sons, Inc. J Graph Theory 35: 8–20, 2000     

Hamilton cycles in Euler tour graph

In this paper we define the Euler tour graph of an Eulerina graph by K-transformations, which was introduced by Kotzig in 1966 (in “Theory of Graphs” (P. Erdös and G. Katona, Eds.), Proc., Colloq., Tihany, Hungary, September, 1966, Akad. Kaido, Hungarian Academy of Sciences, Budapest, 1968) and prove that any edge in an Euler tour graph is in a Hamilton cycle.     

Hamilton equations for infinite-dimensional systems, and their variational equations

For systems with infinitely many degrees of freedom, we establish a relationship between the solutions and first integrals of noncanonical Hamilton equations, their variational equations, and the adjoint variational equations.     

Calculs De Facteurs Epsilon De Paires Pour GLn Sur Un Corps Local, I

Soient F un corps commutatif localement compact non archimédienet un caractère additif non trivial de F. Soient unereprésentation du groupe de Weil–Deligne de F,et sa contragrédiente. Nous calculons le facteur (, , ). De manière analogue, nous calculons le facteur (x, , ) pour toute représentationadmissible irréductible de GL_n(F). En conséquence,si F est de caractéristique nulle et si et se correspondentpar la correspondance de Langlands construite par M. Harris,ou celle construite par les auteurs, alors les facteurs (, , s) et (x, , s) sont égaux pour tout nombre complexe s. Let F be a non-Archimedean local field and a non-trivial additivecharacter of F. Let be a representation of the Weil–Delignegroup of F and its contragredient representation. We compute (, , ). Analogously, we compute (x, , ) for all irreducible admissible representations of GL_n(F).Consequently, if F has characteristic zero, and , correspondvia the Langlands correspondence established by M. Harris orthe correspondence constructed by the authors, then we have(, , s) = (x, , s) for all sC. 1991 Mathematics Subject Classification22E50.     

On Hamilton cycles in certain planar graphs

Let G be a 2-connected plane graph with outer cycle X_G such that for every minimal vertex cut S of G with |S| ≤ 3, every component of G\S contains a vertex of X_G. A sufficient condition for G to be Hamiltonian is presented. This theorem generalizes both Tutte's theorem that every 4-connected planar graph is Hamiltonian, as well as a recent theorem of Dillencourt about NST-triangulations. A linear algorithm to find a Hamilton cycle can be extracted from the proof. One corollary is that a 4-connected planar graph with the vertices of a triangle deleted is Hamiltonian. © 1996 John Wiley & Sons, Inc.     

Hamilton cycles in digraphs of unitary matrices

A set S⊆V is called a q⁺-set (q^--set, respectively) if S has at least two vertices and, for every u∈S, there exists v∈S,v≠u such that N⁺(u)∩N⁺(v)≠∅ (N^-(u)∩N^-(v)≠∅, respectively). A digraph D is called s-quadrangular if, for every q⁺-set S, we have |∪{N⁺(u)∩N⁺(v):u≠v,u,v∈S}|?|S| and, for every q^--set S, we have |∪{N^-(u)∩N^-(v):u,v∈S)}?|S|. We conjecture that every strong s-quadrangular digraph has a Hamilton cycle and provide some support for this conjecture.     

Hamilton cycles in regular 3-connected graphs

We show in this paper that for k63, every 3-connected, k-regular simple graph on at most vertices is hamiltonian.     

Tight Hamilton cycles in random uniform hypergraphs

In this paper we show that e/n is the sharp threshold for the existence of tight Hamilton cycles in random k ‐uniform hypergraphs, for all k ≥ 4. When k = 3 we show that 1/n is an asymptotic threshold. We also determine thresholds for the existence of other types of Hamilton cycles. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2013