Results 231 to 240 of about 6,576,413 (265)

Learning Rule-Induced Subgraph Representations for Inductive Relation Prediction

Neural Information Processing Systems
Inductive relation prediction (IRP) -- where entities can be different during training and inference -- has shown great power for completing evolving knowledge graphs.
Tianyu Liu, Qitan Lv, Jie Wang, Shuling Yang, Hanzhu Chen   +4 more
semanticscholar   +1 more source

INDUCED SUBGRAPHS OF GAMMA GRAPHS

Discrete Mathematics, Algorithms and Applications, 2013
Let G be a graph. The gamma graph of G denoted by γ ⋅ G is the graph with vertex set V(γ ⋅ G) as the set of all γ-sets of G and two vertices D and S of γ ⋅ G are adjacent if and only if |D ∩ S| = γ(G) – 1. A graph H is said to be a γ-graph if there exists a graph G such that γ ⋅ G is isomorphic to H.
Sridharan, N., Amutha, S., Rao, S. B.
openaire   +1 more source

Excluding induced subgraphs: Critical graphs

Random Structures & Algorithms, 2010
AbstractDetermining the cardinality and describing the structure of H‐free graphs is well‐investigated for many graphs H. In the nineties, Prömel and Steger proved that for a graph H with chromatic number k + 1 almost all graphs not containing H as a subgraph are k‐colorable if and only if H contains a color‐critical edge.
Balogh, József, Butterfield, Jane
openaire   +1 more source

Maximum k-regular induced subgraphs

Journal of Combinatorial Optimization, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cardoso, Domingos Moreira, Kaminski, Marcin, Lozin, Vadim   +2 more
openaire   +2 more sources

Excluding induced subgraphs

2007
In this paper we survey some results concerning the structure and properties of families of graphs defined by excluding certain induced subgraphs, including perfect graphs, claw-free graphs, even-hole-free graphs and others.
Maria Chudnovsky, Paul Seymour
openaire   +1 more source

Factors and Connected Induced Subgraphs

Graphs and Combinatorics, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Matroids Induced by Packing Subgraphs

SIAM Journal on Discrete Mathematics, 2004
Summary: This paper is concerned with the classification of families of graphs \(\mathcal T\) with the following property: For any graph \(G\), the subsets of vertices of \(G\) that can be saturated by packing copies of graphs from \(\mathcal T\) form a collection of independent sets of a matroid.
openaire   +2 more sources

Forbidden Induced Subgraphs for Perfect Matchings

Graphs and Combinatorics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ota, Katsuhiro, Sueiro, Gabriel
openaire   +1 more source

Induced subgraph density. VI. Bounded VC-dimension

Advances in Mathematics, 2023
Tung H. Nguyen, Alex Scott, Paul Seymour
semanticscholar   +1 more source

Induced Subgraph in Random Regular Graph

Journal of Systems Science and Complexity, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiao, Lan, Yan, Guiying, Wu, Yuwen, Ren, Wei   +3 more
openaire   +2 more sources