Quasiminimizers in one dimension: integrability of the derivative,inverse function and obstacle problems

It is shown that a K-quasiminimizer u for the one-dimensional p-Dirichlet integral is a K′-quasiminimizer for the q-Dirichlet integral, 1  ≤  q  <  p ₁(p, K), where p ₁(p, K) > p; the exact value for p ₁(p, K) is obtained. The inverse function of a non-constant u is also K′′-quasiminimizer for the s-Dirichlet integral and the range of the exponent s is specified. Connections between quasiminimizers, superminimizers and solutions to obstacle problems are studied.     

Identity orientation of complete bipartite graphs

An identity orientation of a graph G=(V,E) is an orientation of some of the edges of E such that the resulting partially oriented graph has no automorphism other than the identity. We show that the complete bipartite graph K_s,t, with st, does not have an identity orientation if t3^s-log₃(s-1). We also show that if (r+1)(r+2)2s then K_s,3^s-r does have an identity orientation. These results improve the previous bounds obtained by Harary and Jacobson (Discuss. Math. - Graph Theory 21 (2001) 158). We use these results to determine exactly the values of t for which an identity orientation of K_s,t exists for 2s17.     

L’Extension Abelienne D’une Categorie semi-abelienne

We show that if (K,L) is a semi-abelian category, there exists an abelian categoryK ^x with the followings properties:

Defective choosability of graphs with no edge‐plus‐independent‐set minor

It is proved that, if s ≥ 2, a graph that does not have K₂ + K _s = K₁ + K_{1, s} as a minor is (s, 1)*‐choosable. This completes the proof that such a graph is (s + 1 ? d,d)*‐choosable whenever 0 ≤ d ≤ s ?1 © 2003 Wiley Periodicals, Inc. J Graph Theory 45: 51–56, 2004     

Robin Capacity and Lift of Infinitely Thin Airfoils

M.A. Lavrent'ev in 1934 proved that a circle arc provides the maximal aerodynamical lift P in the class of all arcs γ of fixed length l with curvature K(s) ≤ (1/21)(l)^?1, 0 ≤ s ≤ l. We consider the case of a nonconstant majorant for K(s) and show that the Lavrent'ev constant (1/21) can be increased by almost a factor of 3. The proof uses variation of the Robin capacities for the edges of the slit along γ under increase of K(s) on an infinitesimal segment. We also prove that the sum of these Robin capacities equals the transfinite diameter of γ, and the difference coincides with the lift P for γ.     

On the conjecture of hajós

Hajós conjectured that everys-chromatic graph contains a subdivision ofK _s, the complete graph ons vertices. Catlin disproved this conjecture. We prove that almost all graphs are counter-examles in a very strong sense.     

Induced Subdivisions In <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">s,s</Emphasis></Subscript>-Free Graphs of Large Average Degree

We prove that for every graph H and for every s there exists d=d(H,s) such that every graph of average degree at least d contains either a K_s,s as a subgraph or an induced subdivision of H.     

The minimum degree of Ramsey‐minimal graphs

We write H → G if every 2‐coloring of the edges of graph H contains a monochromatic copy of graph G. A graph H is G‐minimal if H → G, but for every proper subgraph H′ of H, H′ ? G. We define s(G) to be the minimum s such that there exists a G‐minimal graph with a vertex of degree s. We prove that s(K_k) = (k ? 1)² and s(K_a,b) = 2 min(a,b) ? 1. We also pose several related open problems. © 2006 Wiley Periodicals, Inc. J Graph Theory 54: 167–177, 2007     

Induced representations,transferred Chern classes and Morava rings <Emphasis Type="Italic">K</Emphasis>(<Emphasis Type="Italic">s</Emphasis>)*(<Emphasis Type="Italic">BG</Emphasis>): Some calculations

The ring structure of Morava K-theory K(s)*(BG) for the 2-group no. 38 of order 32 from the Hall-Senior list is calculated. Previously it was known that K(s)*(BG) is evenly generated and for s = 2 is generated by Chern characteristic classes.     

The paley-wiener theorem for the radon transform

We prove that the support of a complex-valued function f in ?^k is contained in a convex set K if and only if the support of its Radon transform k(s, ω) is, for each ω, contained in s ≦ S_K (ω); here S_K is the support function of the set K. This theorem is used to determine the propagation speeds of hyperbolic differential equations with constant coefficients, to prove the nonexistence of point spectrum for a certain class of partial differential operators, and to give a simple reduction of Lions' convolution theorem to the one-dimensional convolution theorem of Titchmarsh.     

Continuous k‐to‐1 functions between complete graphs whose orders are of a different parity

A function between graphs is k‐to‐1 if each point in the codomain has precisely k pre‐images in the domain. Given two graphs, G and H, and an integer k≥1, and considering G and H as subsets of ?³, there may or may not be a k‐to‐1 continuous function (i.e. a k‐to‐1 map in the usual topological sense) from G onto H. In this paper we consider graphs G and H whose order is of a different parity and determine the even and odd values of k for which there exists a k‐to‐1 map from G onto H. We first consider k‐to‐1 maps from K_2r onto K_2s+1 and prove that for 1≤r≤s, (r, s)≠(1, 1), there is a continuous k‐to‐1 map for k even if and only if k≥2s and for k odd if and only if k≥?s?_o (where ?s?_o indicates the next odd integer greater than or equal to s). We then consider k‐to‐1 maps from K_2s+1 onto K_2s. We show that for 1≤r<s, such a map exists for even values of k if and only if k≥2s. We also prove that whatever the values of r and s are, no such k‐to‐1 map exists for odd values of k. To conclude, we give all triples (n, k, m) for which there is a k‐to‐1 map from K_n onto K_m in the case when n≤m. © 2009 Wiley Periodicals, Inc. J Graph Theory 65: 35–60, 2010.     

On holomorphic curves in a complex Grassmann manifold <Emphasis Type="Italic">G</Emphasis>(2, <Emphasis Type="Italic">n</Emphasis>)

Let s : S ² → G(2, n) be a linearly full totally unramified non-degenerate holomorphic curve in a complex Grassmann manifold G(2, n), and let K(s) be its Gaussian curvature. It is proved that K(s) = \frac4n-2{K(s) = \frac{4}{n-2}} if K(s) satisfies K(s) 3 \frac4n-2{K(s) \geq \frac{4}{n-2}} or K(s) ￡ \frac4n-2 {K(s) \leq \frac{4}{n-2} } everywhere on S ². In particular, K(s) = \frac4n-2{K(s) = \frac{4}{n-2}} if K(s) is constant.     

Vertex coloring complete multipartite graphs from random lists of size 2

Let K_s×m be the complete multipartite graph with s parts and m vertices in each part. Assign to each vertex v of K_s×m a list L(v) of colors, by choosing each list uniformly at random from all 2-subsets of a color set C of size σ(m). In this paper we determine, for all fixed s and growing m, the asymptotic probability of the existence of a proper coloring φ, such that φ(v)∈L(v) for all v∈V(K_s×m). We show that this property exhibits a sharp threshold at σ(m)=2(s−1)m.     

Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree

The smallest n such that every colouring of the edges of K _n must contain a monochromatic star K _1,s+1 or a properly edge-coloured K _t is denoted by f (s, t). Its existence is guaranteed by the Erdős–Rado Canonical Ramsey theorem and its value for large t was discussed by Alon, Jiang, Miller and Pritikin (Random Struct. Algorithms 23:409–433, 2003). In this note we primarily consider small values of t. We give the exact value of f (s, 3) for all s ≥ 1 and the exact value of f (2, 4), as well as reducing the known upper bounds for f (s, 4) and f (s, t) in general.     

Off‐diagonal and asymptotic results on the Ramsey number r(K2,m,K2,n)

An upper bound on the Ramsey number r(K_2,n‐s,K_2,n) where s ≥ 2 is presented. Considering certain r(K_2,n‐s,K_2,n)‐colorings obtained from strongly regular graphs, we additionally prove that this bound matches the exact value of r(K_2,n‐s,K_2,n) in infinitely many cases if holds. Moreover, the asymptotic behavior of r(K_2,m,K_2,n) is studied for n being sufficiently large depending on m. We conclude with a table of all known Ramsey numbers r(K_2,m,K_2,n) where m,n ≤ 10. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 252–268, 2003     

Pseudo-Almost Integral Elements

Let D be an integral domain with quotient field K. We define an element α ∈ K to be pseudo-almost integral over D if there is an infinite increasing sequence {s _i } of natural numbers and a nonzero c ∈ D with cα ^{s _i}  ∈ D. We investigate when a pseudo-almost integral element is almost integral or integral. We also determine the sequences {s _i } with the property that for any domain D and α ∈ K, whenever cα ^{s _i}  ∈ D for some nonzero c ∈ D, than α is actually almost integral over D.     

Complete Minors In <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">s,s</Emphasis></Subscript>-Free Graphs

We prove that for a fixed integer s2 every K _s,s -free graph of average degree at least r contains a K _p minor where . A well-known conjecture on the existence of dense K _s,s -free graphs would imply that the value of the exponent is best possible. Our result implies Hadwigers conjecture for K _s,s -free graphs whose chromatic number is sufficiently large compared with s.     

The minimal degree of plane models of algebraic curves and double coverings

Let C be a smooth irreducible projective curve of genus g and s(C, 2) (or simply s(2)) the minimal degree of plane models of C. We show the non-existence of curves with s(2) = g for g ≥ 10, g ≠ 11. Another main result is determining the value of s(2) for double coverings of hyperelliptic curves. We also give a criterion for a curve with big s(2) to be a double covering.