scholarly journals Exact Minimum Codegree Thresholds for $K_4^-$-Covering and $K_5^-$-Covering

10.37236/8784 ◽  
2020 ◽  
Vol 27 (3) ◽  
Author(s):  
Lei Yu ◽  
Xinmin Hou ◽  
Yue Ma ◽  
Boyuan Liu
Keyword(s):  
Open Problem ◽  
Discrete Math ◽  
Minimum Integer

Given two $3$-graphs $F$ and $H$, an $F$-covering of $H$ is a collection of copies of $F$ in $H$ such that each vertex of $H$ is contained in at least one copy of them. Let $c_2(n,F)$ be the minimum integer $t$ such that every 3-graph with minimum codegree greater than $t$ has an $F$-covering.  In this note, we answer an open problem of Falgas-Ravry and Zhao (SIAM J. Discrete Math., 2016) by determining the exact value of $c_2(n, K_4^-)$ and $c_2(n, K_5^-)$, where $K_t^-$ is the complete $3$-graph on $t$ vertices with one edge removed.

scholarly journals On the Book Thickness of k-Trees

2011 ◽  
Vol Vol. 13 no. 3 (Graph and Algorithms) ◽  
Author(s):  
Vida Dujmović ◽  
David R. Wood
Keyword(s):  
Open Problem ◽  
Discrete Math ◽  
Tree Decomposition ◽  
International Audience

Graphs and Algorithms International audience Every k-tree has book thickness at most k + 1, and this bound is best possible for all k \textgreater= 3. Vandenbussche et al. [SIAM J. Discrete Math., 2009] proved that every k-tree that has a smooth degree-3 tree decomposition with width k has book thickness at most k. We prove this result is best possible for k \textgreater= 4, by constructing a k-tree with book thickness k + 1 that has a smooth degree-4 tree decomposition with width k. This solves an open problem of Vandenbussche et al.

scholarly journals Separation dimension and degree

2019 ◽  
pp. 1-10
Author(s):  
ALEX SCOTT ◽  
DAVID R. WOOD
Keyword(s):  
Graph Theory ◽  
Positive Integer ◽  
Chromatic Number ◽  
Open Problem ◽  
Maximum Degree ◽  
Discrete Math ◽  
Constant Factor ◽  
Axis Parallel ◽  
Parallel Hyperplane ◽  
Separation Dimension

Abstract The separation dimension of a graph G is the minimum positive integer d for which there is an embedding of G into ℝ d , such that every pair of disjoint edges are separated by some axis-parallel hyperplane. We prove a conjecture of Alon et al. [SIAM J. Discrete Math. 2015] by showing that every graph with maximum degree Δ has separation dimension less than 20Δ, which is best possible up to a constant factor. We also prove that graphs with separation dimension 3 have bounded average degree and bounded chromatic number, partially resolving an open problem by Alon et al. [J. Graph Theory 2018].

scholarly journals On an open problem of Simsek concerning the computation of a family of special numbers

2019 ◽  
Vol 13 (1) ◽  
pp. 61-72 ◽  
Author(s):  
Aimin Xu
Keyword(s):  
General Result ◽  
Open Problem ◽  
Stirling Numbers ◽  
Discrete Math ◽  
Euler Numbers ◽  
Negative Order ◽  
Positive Integers

Simsek [Y. Simsek, New families of special numbers for computing negative order Euler numbers and related numbers and polynomials, Appl. Anal. Discrete Math. 12(2018), 1-35.] conjectured that B(d,k)=(kd + x1kd-1 + x2kd-2 +...+ xd-1k)2k-d; where x1,x2,..., xd-1; d are positive integers, and proposed the following open problem: (I) How can we compute the coefficients x1, x2, ... , xd-1? (II) Is it possible to find the function fd(x) = ??,k=1 B(d,k)xk? By using the familiar Stirling numbers of the first and second kind, we solve this problem. We further obtain a general result on the generalized numbers of B(d,k).

Planar graphs without intersecting 5-cycles are signed-4-choosable

2021 ◽  
pp. 2150151
Author(s):  
Seog-Jin Kim ◽  
Xiaowei Yu
Keyword(s):  
Planar Graph ◽  
Planar Graphs ◽  
Discrete Math ◽  
Signed Graph ◽  
List Coloring ◽  
Minimum Integer ◽  
Number Formula ◽  
Choice Number ◽  
The Difference ◽  
Signature Formula

A signed graph is a pair [Formula: see text], where [Formula: see text] is a graph and [Formula: see text] is a signature of [Formula: see text]. A set [Formula: see text] of integers is symmetric if [Formula: see text] implies that [Formula: see text]. Given a list assignment [Formula: see text] of [Formula: see text], an [Formula: see text]-coloring of a signed graph [Formula: see text] is a coloring [Formula: see text] of [Formula: see text] such that [Formula: see text] for each [Formula: see text] and [Formula: see text] for every edge [Formula: see text]. The signed choice number [Formula: see text] of a graph [Formula: see text] is defined to be the minimum integer [Formula: see text] such that for any [Formula: see text]-list assignment [Formula: see text] of [Formula: see text] and for any signature [Formula: see text] on [Formula: see text], there is a proper [Formula: see text]-coloring of [Formula: see text]. List signed coloring is a generalization of list coloring. However, the difference between signed choice number and choice number can be arbitrarily large. Hu and Wu [Planar graphs without intersecting [Formula: see text]-cycles are [Formula: see text]-choosable, Discrete Math. 340 (2017) 1788–1792] showed that every planar graph without intersecting 5-cycles is 4-choosable. In this paper, we prove that [Formula: see text] if [Formula: see text] is a planar graph without intersecting 5-cycles, which extends the main result of [D. Hu and J. Wu, Planar graphs without intersecting [Formula: see text]-cycles are [Formula: see text]-choosable, Discrete Math. 340 (2017) 1788–1792].

The Yukawa Potential Function and Reciprocal Univalent Function

2013 ◽  
Vol 3 (2) ◽  
pp. 197-202
Author(s):  
Amir Pishkoo ◽  
Maslina Darus
Keyword(s):  
Mathematical Model ◽  
Unit Disk ◽  
Potential Function ◽  
Univalent Function ◽  
Open Problem ◽  
Yukawa Potential ◽  
Reciprocal Theorem ◽  
Problem Statement ◽  
Fundamental Forces

This paper presents a mathematical model that provides analytic connection between four fundamental forces (interactions), by using modified reciprocal theorem,derived in the paper, as a convenient template. The essential premise of this work is to demonstrate that if we obtain with a form of the Yukawa potential function [as a meromorphic univalent function], we may eventually obtain the Coloumb Potential as a univalent function outside of the unit disk. Finally, we introduce the new problem statement about assigning Meijer's G-functions to Yukawa and Coloumb potentials as an open problem.

scholarly journals On the star forest polytope for trees and cycles

2019 ◽  
Vol 53 (5) ◽  
pp. 1763-1773
Author(s):  
Meziane Aider ◽  
Lamia Aoudia ◽  
Mourad Baïou ◽  
A. Ridha Mahjoub ◽  
Viet Hung Nguyen
Keyword(s):  
Undirected Graph ◽  
Dominating Set ◽  
Discrete Math ◽  
Complete Characterization ◽  
Facial Structure ◽  
Maximum Weight ◽  
Single Node ◽  
End Node ◽  
Vertex Disjoint

Let G = (V, E) be an undirected graph where the edges in E have non-negative weights. A star in G is either a single node of G or a subgraph of G where all the edges share one common end-node. A star forest is a collection of vertex-disjoint stars in G. The weight of a star forest is the sum of the weights of its edges. This paper deals with the problem of finding a Maximum Weight Spanning Star Forest (MWSFP) in G. This problem is NP-hard but can be solved in polynomial time when G is a cactus [Nguyen, Discrete Math. Algorithms App. 7 (2015) 1550018]. In this paper, we present a polyhedral investigation of the MWSFP. More precisely, we study the facial structure of the star forest polytope, denoted by SFP(G), which is the convex hull of the incidence vectors of the star forests of G. First, we prove several basic properties of SFP(G) and propose an integer programming formulation for MWSFP. Then, we give a class of facet-defining inequalities, called M-tree inequalities, for SFP(G). We show that for the case when G is a tree, the M-tree and the nonnegativity inequalities give a complete characterization of SFP(G). Finally, based on the description of the dominating set polytope on cycles given by Bouchakour et al. [Eur. J. Combin. 29 (2008) 652–661], we give a complete linear description of SFP(G) when G is a cycle.

scholarly journals Compact Differences of Composition Operators on Bergman Spaces Induced by Doubling Weights

2021 ◽  
Author(s):  
Bin Liu ◽  
Jouni Rättyä ◽  
Fanglei Wu
Keyword(s):  
Bergman Space ◽  
Open Problem ◽  
Lebesgue Space ◽  
Composition Operators ◽  
Bergman Spaces ◽  
Weighted Bergman Space ◽  
Carleson Measures ◽  
Doubling Weights ◽  
The Way

AbstractBounded and compact differences of two composition operators acting from the weighted Bergman space $$A^p_\omega $$ A ω p to the Lebesgue space $$L^q_\nu $$ L ν q , where $$0<q<p<\infty $$ 0 < q < p < ∞ and $$\omega $$ ω belongs to the class "Equation missing" of radial weights satisfying two-sided doubling conditions, are characterized. On the way to the proofs a new description of q-Carleson measures for $$A^p_\omega $$ A ω p , with $$p>q$$ p > q and "Equation missing", involving pseudohyperbolic discs is established. This last-mentioned result generalizes the well-known characterization of q-Carleson measures for the classical weighted Bergman space $$A^p_\alpha $$ A α p with $$-1<\alpha <\infty $$ - 1 < α < ∞ to the setting of doubling weights. The case "Equation missing" is also briefly discussed and an open problem concerning this case is posed.

scholarly journals Optimal regularity of stable solutions to nonlinear equations involving the p-Laplacian

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Xavier Cabré ◽  
Pietro Miraglio ◽  
Manel Sanchón
Keyword(s):  
Dirichlet Problem ◽  
Optimal Condition ◽  
Bounded Domain ◽  
Laplace Operator ◽  
Nonlinear Equations ◽  
Open Problem ◽  
Optimal Range ◽  
Optimal Regularity ◽  
Smooth Bounded Domain ◽  
Stable Solutions

AbstractWe consider the equation {-\Delta_{p}u=f(u)} in a smooth bounded domain of {\mathbb{R}^{n}}, where {\Delta_{p}} is the p-Laplace operator. Explicit examples of unbounded stable energy solutions are known if {n\geq p+\frac{4p}{p-1}}. Instead, when {n<p+\frac{4p}{p-1}}, stable solutions have been proved to be bounded only in the radial case or under strong assumptions on f. In this article we solve a long-standing open problem: we prove an interior {C^{\alpha}} bound for stable solutions which holds for every nonnegative {f\in C^{1}} whenever {p\geq 2} and the optimal condition {n<p+\frac{4p}{p-1}} holds. When {p\in(1,2)}, we obtain the same result under the nonsharp assumption {n<5p}. These interior estimates lead to the boundedness of stable and extremal solutions to the associated Dirichlet problem when the domain is strictly convex. Our work extends to the p-Laplacian some of the recent results of Figalli, Ros-Oton, Serra, and the first author for the classical Laplacian, which have established the regularity of stable solutions when {p=2} in the optimal range {n<10}.

scholarly journals Quantum Mean-Field Games with the Observations of Counting Type

Games ◽  
2021 ◽  
Vol 12 (1) ◽  
pp. 7
Author(s):  
Vassili N. Kolokoltsov
Keyword(s):  
Game Theory ◽  
Nash Equilibrium ◽  
Open Problem ◽  
Existence And Uniqueness ◽  
Existence Of Solutions ◽  
Mean Field ◽  
Mean Field Games ◽  
Quantum Game ◽  
Quantum Games ◽  
Interesting Open Problem

Quantum games and mean-field games (MFG) represent two important new branches of game theory. In a recent paper the author developed quantum MFGs merging these two branches. These quantum MFGs were based on the theory of continuous quantum observations and filtering of diffusive type. In the present paper we develop the analogous quantum MFG theory based on continuous quantum observations and filtering of counting type. However, proving existence and uniqueness of the solutions for resulting limiting forward-backward system based on jump-type processes on manifolds seems to be more complicated than for diffusions. In this paper we only prove that if a solution exists, then it gives an ϵ-Nash equilibrium for the corresponding N-player quantum game. The existence of solutions is suggested as an interesting open problem.

Sign in / Sign up

Export Citation Format

Share Document