Results 61 to 70 of about 735 (221)

Eigenvalues and forbidden subgraphs I

Linear Algebra and its Applications, 2007
Some calculation errors in the first version are ...
openaire   +3 more sources

Rainbow vertex-connection and forbidden subgraphs

Discussiones Mathematicae Graph Theory, 2018
11 ...
Li Wenjing, Li Xueliang, Zhang Jingshu
openaire   +4 more sources

Apex Graphs and Cographs

Theory and Applications of Graphs
A class G of graphs is called hereditary if it is closed under taking induced subgraphs. We denote by G^{apex} the class of graphs G that contain a vertex v such that G − v is in G.
Jagdeep Singh, Vaidy Sivaraman, Thomas Zaslavsky   +2 more
doaj   +1 more source

Forbidden Pairs and (k,m)-Pancyclicity

Discussiones Mathematicae Graph Theory, 2017
A graph G on n vertices is said to be (k, m)-pancyclic if every set of k vertices in G is contained in a cycle of length r for each r ∈ {m, m+1, . . . , n}.
Crane Charles Brian
doaj   +1 more source

Crossing estimates for the Ising model on general s‐embeddings

Proceedings of the London Mathematical Society, Volume 131, Issue 4, October 2025.
Abstract We prove Russo–Seymour–Welsh‐type crossing estimates for the FK–Ising model on general s‐embeddings whose origami map has an asymptotic Lipschitz constant strictly smaller than 1, provided it satisfies a mild non‐degeneracy assumption. This result extends the work of Chelkak and provides a general framework to prove that the usual connection ...
Rémy Mahfouf
wiley   +1 more source

Weighted Turán Theorems With Applications to Ramsey‐Turán Type of Problems

Journal of Graph Theory, Volume 110, Issue 1, Page 59-71, September 2025.
ABSTRACT We study extensions of Turán Theorem in edge‐weighted settings. A particular case of interest is when constraints on the weight of an edge come from the order of the largest clique containing it. These problems are motivated by Ramsey‐Turán type problems.
József Balogh, Domagoj Bradač, Bernard Lidický   +2 more
wiley   +1 more source

Forbidden Subgraphs and Complete Partitions

The Electronic Journal of Combinatorics
A graph is called an $(r,k)$-graph if its vertex set can be partitioned into $r$ parts, each having at most $k$ vertices and there is at least one edge between any two parts. Let $f(r,H)$ be the minimum $k$ for which there exists an $H$-free $(r,k)$-graph.
Byrne, John, Tait, Michael, Timmons, Craig   +2 more
openaire   +2 more sources

Forbidden subgraphs and the König–Egerváry property

Discrete Applied Mathematics, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bonomo, F., Dourado, M.C., Durán, G., Faria, L., Grippo, L.N., Safe, M.D.   +5 more
openaire   +7 more sources

The Generic Circular Triangle‐Free Graph

Journal of Graph Theory, Volume 109, Issue 4, Page 426-445, August 2025.
ABSTRACT In this article, we introduce the generic circular triangle‐free graph C 3 and propose a finite axiomatization of its first‐order theory. In particular, our main results show that a countable graph G embeds into C 3 if and only if it is a { K 3 , K 1 + 2 K 2 , K 1 + C 5 , C 6 }‐free graph.
Manuel Bodirsky, Santiago Guzmán‐Pro
wiley   +1 more source

Sequentially Constrained Hamilton Cycles in Random Graphs

Random Structures &Algorithms, Volume 67, Issue 1, August 2025.
ABSTRACT We discuss the existence of Hamilton cycles in the random graph Gn,p$$ {G}_{n,p} $$ where there are restrictions caused by (i) coloring sequences, (ii) a subset of vertices must occur in a specific order, and (iii) there is a bound on the number of inversions in the associated permutation.
Alan Frieze, Wesley Pegden
wiley   +1 more source