scholarly journals Two Results on Ramsey-Turán Theory

10.37236/9135 ◽  
2021 ◽  
Vol 28 (4) ◽  
Author(s):  
Meng Liu ◽  
Yusheng Li
Keyword(s):  
Independence Number ◽  
Positive Function ◽  
Free Graph ◽  
Fixed Integer

Let $f(n)$ be a positive function and $H$ a graph. Denote by $\textbf{RT}(n,H,f(n))$ the maximum number of edges of an $H$-free graph on $n$ vertices with independence number less than $f(n)$. It is shown that  $\textbf{RT}(n,K_4+mK_1,o(\sqrt{n\log n}))=o(n^2)$ for any fixed integer $m\geqslant 1$ and $\textbf{RT}(n,C_{2m+1},f(n))=O(f^2(n))$ for any fixed integer $m\geqslant 2$ as $n\to\infty$.

scholarly journals Independence Number and Disjoint Theta Graphs

10.37236/637 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Shinya Fujita ◽  
Colton Magnant
Keyword(s):  
Independence Number ◽  
Disjoint Paths ◽  
Ramsey Problem ◽  
Fixed Integer ◽  
Sharp Bounds ◽  
Vertex Disjoint ◽  
The Relationship

The goal of this paper is to find vertex disjoint even cycles in graphs. For this purpose, define a $\theta$-graph to be a pair of vertices $u, v$ with three internally disjoint paths joining $u$ to $v$. Given an independence number $\alpha$ and a fixed integer $k$, the results contained in this paper provide sharp bounds on the order $f(k, \alpha)$ of a graph with independence number $\alpha(G) \leq \alpha$ which contains no $k$ disjoint $\theta$-graphs. Since every $\theta$-graph contains an even cycle, these results provide $k$ disjoint even cycles in graphs of order at least $f(k, \alpha) + 1$. We also discuss the relationship between this problem and a generalized ramsey problem involving sets of graphs.

A Transferable, Polarisable Force Field for Ionic Liquids

2019 ◽  
Author(s):  
Kateryna Goloviznina ◽  
José N. Canongia Lopes ◽  
Margarida Costa Gomes ◽  
Agilio Padua
Keyword(s):  
Ionic Liquids ◽  
Force Field ◽  
Force Fields ◽  
Dipole Moments ◽  
Van Der Waals Interactions ◽  
First Principles Calculations ◽  
Ion Diffusion ◽  
Fixed Integer ◽  
Molecular Compounds ◽  
Induced Dipoles

A general, transferable polarisable force field for molecular simulation of ionic liquids and their mixtures with molecular compounds is developed. This polarisable model is derived from the widely used CL\&P fixed-charge force field that describes most families of ionic liquids, in a form compatible with OPLS-AA, one of the major force fields for organic compounds. Models for ionic liquids with fixed, integer ionic charges lead to pathologically slow dynamics, a problem that is corrected when polarisation effects are included explicitly. In the model proposed here, Drude induced dipoles are used with parameters determined from atomic polarisabilities. The CL\&P force field is modified upon inclusion of the Drude dipoles, to avoid double-counting of polarisation effects. This modification is based on first-principles calculations of the dispersion and induction contributions to the van der Waals interactions, using symmetry-adapted perturbation theory (SAPT) for a set of dimers composed of positive, negative and neutral fragments representative of a wide variety of ionic liquids. The fragment approach provides transferability, allowing the representation of a multitude of cation and anion families, including different functional groups, without need to re-parametrise. Because SAPT calculations are expensive an alternative predictive scheme was devised, requiring only molecular properties with a clear physical meaning, namely dipole moments and atomic polarisabilities. The new polarisable force field, CL\&Pol, describes a broad set set of ionic liquids and their mixtures with molecular compounds, and is validated by comparisons with experimental data on density, ion diffusion coefficients and viscosity. The approaches proposed here can also be applied to the conversion of other fixed-charged force fields into polarisable versions.<br>

Valued Field Graph and Some Related Parameters

2020 ◽  
pp. 389-395
Author(s):  
G. Suresh Singh ◽  
P. K. Prasobha
Keyword(s):  
Finite Field ◽  
Independence Number ◽  
Valued Field ◽  
Vertex Set ◽  
Adic Valuation

Let $K$ be any finite field. For any prime $p$, the $p$-adic valuation map is given by $\psi_{p}:K/\{0\} \to \R^+\bigcup\{0\}$ is given by $\psi_{p}(r) = n$ where $r = p^n \frac{a}{b}$, where $p,a,b$ are relatively prime. The field $K$ together with a valuation is called valued field. Also, any field $K$ has the trivial valuation determined by $\psi{(K)} = \{0,1\}$. Through out the paper K represents $\Z_q$. In this paper, we construct the graph corresponding to the valuation map called the valued field graph, denoted by $VFG_{p}(\Z_{q})$ whose vertex set is $\{v_0,v_1,v_2,\ldots, v_{q-1}\}$ where two vertices $v_i$ and $v_j$ are adjacent if $\psi_{p}(i) = j$ or $\psi_{p}(j) = i$. Here, we tried to characterize the valued field graph in $\Z_q$. Also we analyse various graph theoretical parameters such as diameter, independence number etc.

scholarly journals Toughness, Forbidden Subgraphs and Pancyclicity

2021 ◽  
Vol 37 (3) ◽  
pp. 839-866
Author(s):  
Wei Zheng ◽  
Hajo Broersma ◽  
Ligong Wang
Keyword(s):  
Recent Article ◽  
Forbidden Subgraph ◽  
Forbidden Subgraphs ◽  
Free Graph ◽  
Induced Subgraph ◽  
Complete Answer ◽  
Open Case

AbstractMotivated by several conjectures due to Nikoghosyan, in a recent article due to Li et al., the aim was to characterize all possible graphs H such that every 1-tough H-free graph is hamiltonian. The almost complete answer was given there by the conclusion that every proper induced subgraph H of $$K_1\cup P_4$$ K 1 ∪ P 4 can act as a forbidden subgraph to ensure that every 1-tough H-free graph is hamiltonian, and that there is no other forbidden subgraph with this property, except possibly for the graph $$K_1\cup P_4$$ K 1 ∪ P 4 itself. The hamiltonicity of 1-tough $$K_1\cup P_4$$ K 1 ∪ P 4 -free graphs, as conjectured by Nikoghosyan, was left there as an open case. In this paper, we consider the stronger property of pancyclicity under the same condition. We find that the results are completely analogous to the hamiltonian case: every graph H such that any 1-tough H-free graph is hamiltonian also ensures that every 1-tough H-free graph is pancyclic, except for a few specific classes of graphs. Moreover, there is no other forbidden subgraph having this property. With respect to the open case for hamiltonicity of 1-tough $$K_1\cup P_4$$ K 1 ∪ P 4 -free graphs we give infinite families of graphs that are not pancyclic.

scholarly journals Universal and unavoidable graphs

2021 ◽  
pp. 1-14
Author(s):  
Matija Bucić ◽  
Nemanja Draganić ◽  
Benny Sudakov
Keyword(s):  
Free Graph ◽  
Turán Number ◽  
Work Done

Abstract The Turán number ex(n, H) of a graph H is the maximal number of edges in an H-free graph on n vertices. In 1983, Chung and Erdős asked which graphs H with e edges minimise ex(n, H). They resolved this question asymptotically for most of the range of e and asked to complete the picture. In this paper, we answer their question by resolving all remaining cases. Our result translates directly to the setting of universality, a well-studied notion of finding graphs which contain every graph belonging to a certain family. In this setting, we extend previous work done by Babai, Chung, Erdős, Graham and Spencer, and by Alon and Asodi.

scholarly journals Independence and domination on shogiboard graphs

2017 ◽  
Vol 4 (8) ◽  
pp. 25-37 ◽  
Author(s):  
Doug Chatham
Keyword(s):  
Independence Number ◽  
Domination Number ◽  
The Other ◽  
Independent Domination

Abstract Given a (symmetrically-moving) piece from a chesslike game, such as shogi, and an n×n board, we can form a graph with a vertex for each square and an edge between two vertices if the piece can move from one vertex to the other. We consider two pieces from shogi: the dragon king, which moves like a rook and king from chess, and the dragon horse, which moves like a bishop and rook from chess. We show that the independence number for the dragon kings graph equals the independence number for the queens graph. We show that the (independent) domination number of the dragon kings graph is n − 2 for 4 ≤ n ≤ 6 and n − 3 for n ≥ 7. For the dragon horses graph, we show that the independence number is 2n − 3 for n ≥ 5, the domination number is at most n−1 for n ≥ 4, and the independent domination number is at most n for n ≥ 5.

scholarly journals Average distance and independence number

1994 ◽  
Vol 51 (1-2) ◽  
pp. 75-83 ◽  
Author(s):  
P. Dankelmann
Keyword(s):  
Average Distance ◽  
Independence Number

scholarly journals The average tree solution for cycle-free graph games

2008 ◽  
Vol 62 (1) ◽  
pp. 77-92 ◽  
Author(s):  
P. Jean Jacques Herings ◽  
Gerard van der Laan ◽  
Dolf Talman
Keyword(s):  
Free Graph ◽  
Graph Games
Sign in / Sign up

Export Citation Format

Share Document