Results 111 to 120 of about 6,576,413 (265)

Induced subgraphs of given sizes

Discrete Mathematics, 1999
This paper considers certain ``natural'' generalizations of ``Turán-type'' extremal problems investigated earlier by \textit{P. Erdős} [Extremal problems in graph theory. Theory Graphs Appl., Proc. Symp. Smolenice 1963, 29-36 (1964; Zbl 0161.20501)] and by \textit{P. Erdős, V. T. Sós}, and the reviewer [Some extremal problems on \(r\)-graphs.
Erdős, Paul, Füredi, Zoltán, Rothschild, Bruce L., Sós, Vera T.   +3 more
openaire   +1 more source

Absolutely avoidable order-size pairs for induced subgraphs [PDF]

, 2023
Maria Axenovich, Lea Weber
openalex   +1 more source

On 3-Colorings of Direct Products of Graphs

Discussiones Mathematicae Graph Theory, 2019
The k-independence number of a graph G, denoted as αk(G), is the order of a largest induced k-colorable subgraph of G. In [S. Špacapan, The k-independence number of direct products of graphs, European J. Combin.
Špacapan Simon
doaj   +1 more source

Outer independent total double Italian domination number [PDF]

Computer Science Journal of Moldova
If $G$ is a graph with vertex set $V(G)$, then let $N[u]$ be the closed neighborhood of the vertex $u\in V(G)$. A total double Italian dominating function (TDIDF) on a graph $G$ is a function $f:V(G)\rightarrow\{0,1,2,3\}$ satisfying (i) $f(N[u])\ge 3 ...
Seyed Mahmoud Sheikholeslami, Lutz Volkmann   +1 more
doaj   +1 more source

Maximising the number of connected induced subgraphs of unicyclic graphs

, 2022
Audace A. V. Dossou-Olory
openalex   +2 more sources

Induced subgraphs of hypercubes

European Journal of Combinatorics, 2013
Let $Q_k$ denote the $k$-dimensional hypercube on $2^k$ vertices. A vertex in a subgraph of $Q_k$ is {\em full} if its degree is $k$. We apply the Kruskal-Katona Theorem to compute the maximum number of full vertices an induced subgraph on $n\leq 2^k$ vertices of $Q_k$ can have, as a function of $k$ and $n$. This is then used to determine $\min(\max(|V(
openaire   +2 more sources

Signal Subgraph Estimation Via Vertex Screening

, 2018
Graph classification and regression have wide applications in a variety of domains. A graph is a complex and high-dimensional object, which poses great challenges to traditional machine learning algorithms.
Badea, Alexandra, Priebe, Carey E., Shen, Cencheng, Vogelstein, Joshua T., Wang, Shangsi   +4 more
core  

Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyarfas' conjectures [PDF]

, 2014
Maria Chudnovsky, Paul Seymour, Alex Scott   +2 more
openalex   +1 more source

Finding large induced sparse subgraphs in $C_{>t}$-free graphs in quasipolynomial time [PDF]

, 2020
Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Paweł Rzążewski   +4 more
openalex   +2 more sources

Domination properties and induced subgraphs

Discrete Mathematics, 1993
Two types of classes of graphs are studied. The class \(\text{Forb}(C_ t,P_ t)\) is the class of all graphs which contain no induced subgraph isomorphic to the circuit \(C_ t\) with \(t\) vertices or to the path \(P_ t\) with \(t\) vertices. The class \(\text{Dom}(d,k)\) is the class of graphs \(G\) in which every connected induced subgraph \(H ...
Bascó, G., Tuza, Z.
openaire   +2 more sources