Results 91 to 100 of about 10,088 (246)
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
Induced Minor Free Graphs: Isomorphism and Clique-width
, 2016 Given two graphs $G$ and $H$, we say that $G$ contains $H$ as an induced minor if a graph isomorphic to $H$ can be obtained from $G$ by a sequence of vertex deletions and edge contractions.
Belmonte, Rémy +2 more
core +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
Random multilinear maps and the Erdős box problem
Discrete Analysis, 2021 Random multilinear maps and the Erdős box problem, Discrete Analysis 2021:17, 8 pp. A major theme in extremal combinatorics is determining the maximum number of edges that a graph or hypergraph can have if it does not contain a certain fixed graph or ...
David Conlon +2 more
doaj +1 more source
Heavy subgraphs, stability and hamiltonicity
, 2016 Let $G$ be a graph. Adopting the terminology of Broersma et al. and \v{C}ada, respectively, we say that $G$ is 2-heavy if every induced claw ($K_{1,3}$) of $G$ contains two end-vertices each one has degree at least $|V(G)|/2$; and $G$ is o-heavy if every
Li, Binlong, Ning, Bo
core +2 more sources
Forbidden induced subgraphs for line graphs
Discrete Mathematics, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lcaron, ubomír Šoltés
openaire +3 more sources
Methods in Ecology and Evolution, Volume 16, Issue 8, Page 1851-1867, August 2025.Abstract Being able to infer the interactions between a set of species from observations of the system is of paramount importance to obtain explanatory and predictive models in ecology. We tackled this challenge by employing qualitative modelling frameworks and logic methods for the synthesis of mathematical models that can integrate both observations ...
Loïc Paulevé, Cédric Gaucherel
wiley +1 more source
Planar graph coloring avoiding monochromatic subgraphs: trees and paths make things difficult [PDF]
, 2003 We consider the problem of coloring a planar graph with the minimum number of colors such that each color class avoids one or more forbidden graphs as subgraphs.
Broersma, H.J. +3 more
core +2 more sources
The number of graphs with large forbidden subgraphs
European Journal of Combinatorics, 2010 6 ...
Vladimir Nikiforov, Béla Bollobás
openaire +3 more sources
Induced subgraphs with large degrees at end-vertices for hamiltonicity of claw-free graphs
, 2016 A graph is called \emph{claw-free} if it contains no induced subgraph isomorphic to $K_{1,3}$. Matthews and Sumner proved that a 2-connected claw-free graph $G$ is hamiltonian if every vertex of it has degree at least $(|V(G)|-2)/3$. At the workshop C\&C
Li, Binlong +3 more
core +1 more source