Results 61 to 70 of about 772 (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

Indiscernibles in monadically NIP theories

Bulletin of the London Mathematical Society, Volume 57, Issue 11, Page 3326-3345, November 2025.
Abstract We prove various results around indiscernibles in monadically NIP theories. First, we provide several characterizations of monadic NIP in terms of indiscernibles, mirroring previous characterizations in terms of the behavior of finite satisfiability. Second, we study (monadic) distality in hereditary classes and complete theories.
Samuel Braunfeld, Michael C. Laskowski
wiley   +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

An Implicit Enumeration Approach for Maximum Ratio Clique Relaxations

Networks, Volume 86, Issue 3, Page 241-262, October 2025.
ABSTRACT This article proposes an implicit enumeration approach to solve the maximum ratio s$$ s $$‐plex and the maximum ratio s$$ s $$‐defective clique problems. The approach is inspired by the classical Bron‐Kerbosch algorithm for enumerating all maximal cliques in a graph, which is extended to enumerating structures that are hereditary on induced ...
Yehor Blokhin, Sergiy Butenko, Mykyta Makovenko, Petar Momcilovic, Oleg A. Prokopyev   +4 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

Longest cycles in vertex‐transitive and highly connected graphs

Bulletin of the London Mathematical Society, Volume 57, Issue 10, Page 2975-2990, October 2025.
Abstract We present progress on three old conjectures about longest paths and cycles in graphs. The first pair of conjectures, due to Lovász from 1969 and Thomassen from 1978, respectively, states that all connected vertex‐transitive graphs contain a Hamiltonian path, and that all sufficiently large such graphs even contain a Hamiltonian cycle.
Carla Groenland, Sean Longbrake, Raphael Steiner, Jérémie Turcotte, Liana Yepremyan   +4 more
wiley   +1 more source

Tight bounds for intersection‐reverse sequences, edge‐ordered graphs, and applications

Journal of the London Mathematical Society, Volume 112, Issue 4, October 2025.
Abstract In 2006, Marcus and Tardos proved that if A1,⋯,An$A^1,\dots,A^n$ are cyclic orders on some subsets of a set of n$n$ symbols such that the common elements of any two distinct orders Ai$A^i$ and Aj$A^j$ appear in reversed cyclic order in Ai$A^i$ and Aj$A^j$, then ∑i|Ai|=O(n3/2logn)$\sum _{i} |A^i|=O(n^{3/2}\log n)$.
Barnabás Janzer, Oliver Janzer, Abhishek Methuku, Gábor Tardos   +3 more
wiley   +1 more source

The Largest Subgraph Without A Forbidden Induced Subgraph

Combinatorica
20 ...
Fox, Jacob, Nenadov, Rajko, Pham, Huy Tuan   +2 more
openaire   +2 more sources