Results 101 to 110 of about 6,576,413 (265)
A counterexample to a conjecture about triangle-free induced subgraphs\n of graphs with large chromatic number [PDF]
, 2022 Alvaro Carbonero +3 more
openalex +1 more source
Line Graphs and Forbidden Induced Subgraphs
Journal of Combinatorial Theory, Series B, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lai, Hong-Jian, Šoltés, Ľubomír
openaire +1 more source
Steiner Triple Systems With High Discrepancy
Journal of Combinatorial Designs, Volume 34, Issue 1, Page 5-14, January 2026.ABSTRACT In this paper, we initiate the study of discrepancy questions for combinatorial designs. Specifically, we show that, for every fixed r ≥ 3 and n ≡ 1 , 3 ( mod 6 ), any r‐colouring of the triples on [ n ] admits a Steiner triple system of order n with discrepancy Ω ( n 2 ).
Lior Gishboliner +2 more
wiley +1 more source
The graph grabbing game on {0,1}-weighted graphs
Results in Applied Mathematics, 2019 The graph grabbing game is a two-player game on a weighted connected graph in which two players, Alice and Bob, alternatively remove non-cut vertices one by one to gain the weights on them.
Soogang Eoh, Jihoon Choi
doaj +1 more source
Every graph contains a linearly sized induced subgraph with all degrees odd [PDF]
Advances in Mathematics, 2020 Asaf Ferber, Michael Krivelevich
semanticscholar +1 more source
Protein Science, Volume 35, Issue 1, January 2026.Abstract Proteins perform diverse functions critical to cellular processes. Transitions between functional states are often regulated by post‐translational modifications (PTMs) such as phosphorylation, which dynamically influence protein structure, function, folding, and interactions.
Pathmanaban Ramasamy +3 more
wiley +1 more source
Theory and Applications of GraphsA 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 +2 more
doaj +1 more source
Characterizing the forbidden pairs for graphs to be super-edge-connected
AKCE International Journal of Graphs and CombinatoricsLet [Formula: see text] be a set of given connected graphs. A graph G is said to be [Formula: see text]-free if G contains no H as an induced subgraph for any [Formula: see text].
Hazhe Ye, Yingzhi Tian
doaj +1 more source
Search Result Clustering via Randomized Partitioning of Query-Induced Subgraphs [PDF]
Telfor Journal, 2009 In this paper, we present an approach to search result clustering, using partitioning of underlying link graph. We define the notion of "query-induced subgraph" and formulate the problem of search result clustering as a problem of efficient partitioning ...
A. Bradic
doaj
Induced subgraphs and tree decompositions XII. Grid theorem for pinched graphs [PDF]
, 2023 Bogdan Alecu +3 more
openalex +1 more source