Results 81 to 90 of about 24,599 (177)

Density theorems for bipartite graphs and related Ramsey-type results

, 2007
In this paper, we present several density-type theorems which show how to find a copy of a sparse bipartite graph in a graph of positive density.
Fox, Jacob, Sudakov, Benny
core   +4 more sources

Induced subgraphs and tree decompositions XVI. Complete bipartite induced minors

Journal of Combinatorial Theory, Series B
We prove that for every graph $G$ with a sufficiently large complete bipartite induced minor, either $G$ has an induced minor isomorphic to a large wall, or $G$ contains a large constellation; that is, a complete bipartite induced minor model such that on one side of the bipartition, each branch set is a singleton, and on the other side, each branch ...
Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl   +2 more
openaire   +2 more sources

Vertex-Generator Subgraphs of Complete Bipartite and Tadpole Graphs

European Journal of Pure and Applied Mathematics
Graphs considered in this paper are finite simple undirected graphs. Let $G = (V(G), E(G))$ be a graph with the vertex set $V(G) = \{x_1,x_2,..., x_n\}$, for some positive integer $n$. The vertex space $\mathscr{V}(G)$ of $G$, is a vector space over the field $\mathbb{Z}_2 = \{0,1\}$.
Gino Derek Sepillo, Ma. Joyce Valdez, Meguilito Eyao, Neil Mame   +3 more
openaire   +1 more source

Blow-up lemmas for sparse graphs

Discrete Analysis
Blow-up lemmas for sparse graphs, Discrete Analysis 2025:8, 141 pp. Szemerédi's regularity lemma is, roughly speaking, the statement that for every graph $G$ and every $\epsilon>0$, we can partition the vertex set of $G$ into sets $V_1,\dots,V_k$ of ...
Peter Allen, Julia Böttcher, Hiep Hàn, Yoshiharu Kohayakawa, Yury Person   +4 more
doaj   +1 more source

Homomorphic Preimages of Geometric Cycles

, 2015
A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism from G to H. A classic problem is to characterize the family of homomorphic preimages of a given graph H.
Cockburn, Sally
core  

A heuristic method for multi-block parallel decomposition of a system of partial Boolean functions

Informatika, 2018
A heuristic method for multi-block parallel decomposition of a system of partial Boolean functions is described. The method minimizes the number of functions forming the required superposition.
Yu. V. Pottosin
doaj  

A method for bi-decomposition of partial Boolean functions

Informatika, 2019
The problem of bi-decomposition of a Boolean function is to represent a given Boolean function in the form of a given logic algebra operation over two Boolean functions and so is reduced to specification of these functions.
Yu. V. Pottosin
doaj  

Plane subgraphs in geometric complement of 2-factor and complete bipartite geometric graph

Electronic Notes in Discrete Mathematics, 2006
Abstract In this article we study when there exist non-crossing subgraphs in a geometric complement of 2-factor and in a complete bipartite geometric graph.
openaire   +1 more source

Factorization norms and an inverse theorem for MaxCut. [PDF]

Math Ann
Balla I, Hambardzumyan L, Tomon I.
europepmc   +1 more source

Efficient classical sampling from Gaussian boson sampling distributions on unweighted graphs. [PDF]

Nat Commun
Zhang Y, Zhou S, Wang X, Wang Z, Yang Z, Yang R, Xue Y, Li T.   +7 more
europepmc   +1 more source