Results 131 to 140 of about 63,637 (247)
Eigenvalue Approach to Dense Clusters in Hypergraphs
Journal of Graph Theory, Volume 109, Issue 3, Page 353-365, July 2025.ABSTRACT In this article, we investigate the problem of finding in a given weighted hypergraph a subhypergraph with the maximum possible density. Using the notion of a support matrix we prove that the density of an optimal subhypergraph is equal to ∥ A T A ∥ for an optimal support matrix A. Alternatively, the maximum density of a subhypergraph is equal
Yuly Billig
wiley +1 more source
哈林图的偶匹配可扩性(Bipartite matching-extendability of Halin graphs)
Zhejiang Daxue xuebao. Lixue ban, 2009 Let G be a connected graph containing a perfect matching. G is said to be bipartite matching extendable if every matching M of G whose induced subgraph is a bipartite matching extends to a perfect matching of G. The main result is as follows: Halin graph
HUIZhi-hao(惠志昊), ZHAOBiao(赵飚)
doaj +1 more source
Multiple vertex coverings by specified induced subgraphs [PDF]
, 2000 Zoltán Füredi +2 more
openalex +1 more source
Refining Tree‐Decompositions so That They Display the k‐Blocks
Journal of Graph Theory, Volume 109, Issue 3, Page 310-314, July 2025.ABSTRACT Carmesin and Gollin proved that every finite graph has a canonical tree‐decomposition ( T , V ) of adhesion less than k that efficiently distinguishes every two distinct k‐profiles, and which has the further property that every separable k‐block is equal to the unique part of ( T , V ) in which it is contained.
Sandra Albrechtsen
wiley +1 more source
On Sequential Heuristic Methods for the Maximum Independent Set Problem
Discussiones Mathematicae Graph Theory, 2017 We consider sequential heuristics methods for the Maximum Independent Set (MIS) problem. Three classical algorithms, VO [11], MIN [12], or MAX [6] , are revisited. We combine Algorithm MIN with the α-redundant vertex technique[3].
Lê Ngoc C. +2 more
doaj +1 more source
Matched Filters for Noisy Induced Subgraph Detection. [PDF]
IEEE Trans Pattern Anal Mach Intell, 2020 Sussman DL +3 more
europepmc +1 more source
An Algorithm for Finding Large Induced Planar Subgraphs [PDF]
, 2002 Keith Edwards, Graham Farr
openalex +1 more source
A Jump of the Saturation Number in Random Graphs?
Random Structures &Algorithms, Volume 66, Issue 4, July 2025.ABSTRACT For graphs G$$ G $$ and F$$ F $$, the saturation number sat(G,F)$$ sat\left(G,F\right) $$ is the minimum number of edges in an inclusion‐maximal F$$ F $$‐free subgraph of G$$ G $$. In 2017, Korándi and Sudakov initiated the study of saturation in random graphs. They showed that for constant p∈(0,1)$$ p\in \left(0,1\right) $$, whp satG(n,p),Ks=(
Sahar Diskin +2 more
wiley +1 more source
Coloring Graphs With Forbidden Almost Bipartite Subgraphs
Random Structures &Algorithms, Volume 66, Issue 4, July 2025.ABSTRACT Alon, Krivelevich, and Sudakov conjectured in 1999 that for every finite graph F$$ F $$, there exists a quantity c(F)$$ c(F) $$ such that χ(G)≤(c(F)+o(1))Δ/logΔ$$ \chi (G)\le \left(c(F)+o(1)\right)\Delta /\mathrm{log}\Delta $$ whenever G$$ G $$ is an F$$ F $$‐free graph of maximum degree Δ$$ \Delta $$. The largest class of connected graphs F$$
James Anderson +2 more
wiley +1 more source
Some Variations of Perfect Graphs
Discussiones Mathematicae Graph Theory, 2016 We consider (ψk−γk−1)-perfect graphs, i.e., graphs G for which ψk(H) = γk−1(H) for any induced subgraph H of G, where ψk and γk−1 are the k-path vertex cover number and the distance (k − 1)-domination number, respectively.
Dettlaff Magda +3 more
doaj +1 more source