Results 31 to 40 of about 24,599 (177)
Decomposition of an infinite complete graph into complete bipartite subgraphs [PDF]
Časopis pro pěstování matematiky, 1984 It is proved that, for each infinite cardinal p, the complete graph of order exp p is decomposable into r edge-disjoint complete bipartite subgraphs, where r is the cardinality of the set of all subsets A of a p- element set with \(card(A)
openaire +1 more source
Degeneracy of P-free and C⩾-free graphs with no large complete bipartite subgraphs
Journal of Combinatorial Theory, Series B, 2022 A hereditary class of graphs $\mathcal{G}$ is \emph{$ $-bounded} if there exists a function $f$ such that every graph $G \in \mathcal{G}$ satisfies $ (G) \leq f( (G))$, where $ (G)$ and $ (G)$ are the chromatic number and the clique number of $G$, respectively.
Bonamy, Marthe +5 more
openaire +4 more sources
Clique problem, cutting plane proofs and communication complexity
, 2012 Motivated by its relation to the length of cutting plane proofs for the Maximum Biclique problem, we consider the following communication game on a given graph G, known to both players.
Jukna, S.
core +1 more source
Discrete Analysis, 2023 Limits of Latin squares, Discrete Analysis 2023:8, 66 pp. There has been a great deal of work over the last fifteen to twenty years on the theme of continuous limits of discrete combinatorial objects. In particular, any sequence of graphs of increasing
Frederik Garbe +3 more
doaj +1 more source
Polyhedral characteristics of balanced and unbalanced bipartite subgraph problems
, 2017 We study the polyhedral properties of three problems of constructing an optimal complete bipartite subgraph (a biclique) in a bipartite graph. In the first problem we consider a balanced biclique with the same number of vertices in both parts and ...
Bondarenko, Vladimir +2 more
core +2 more sources
Scale Reduction Techniques for Computing Maximum Induced Bicliques
Algorithms, 2017 Given a simple, undirected graph G, a biclique is a subset of vertices inducing a complete bipartite subgraph in G. In this paper, we consider two associated optimization problems, the maximum biclique problem, which asks for a biclique of the maximum ...
Shahram Shahinpour +3 more
doaj +1 more source
, 2017 The Small Set Expansion Hypothesis (SSEH) is a conjecture which roughly states that it is NP-hard to distinguish between a graph with a small subset of vertices whose edge expansion is almost zero and one in which all small subsets of vertices have ...
Manurangsi, Pasin
core +2 more sources
On eulerian irregularity in graphs
Discussiones Mathematicae Graph Theory, 2014 A closed walk in a connected graph G that contains every edge of G exactly once is an Eulerian circuit. A graph is Eulerian if it contains an Eulerian circuit. It is well known that a connected graph G is Eulerian if and only if every vertex of G is even.
Andrews Eric +2 more
doaj +1 more source
Algoritma matching bobot maskimum dalam graph bipartit komplit berboto [PDF]
, 1998 ABSTRAK Suatu matching dalam graph G adalah subgraph 1-regular pada G yang disebabkan oleh kumpulan dart pasangan garis yang tidak adjacent. Suatu matching merupakan matching maksimum bila matching tersebut mempunyai harga pokok maksimum. Matching dalam
Astuti , Yani Parti
core
Properly Colored Cycles in Edge‐Colored Balanced Bipartite Graphs
Journal of Graph Theory, EarlyView.ABSTRACT Let G n , n c ${G}_{n,n}^{c}$ denote a (not necessarily properly) edge‐colored balanced bipartite graph on 2 n $2n$ vertices, that is, in which every edge is assigned a color. A cycle C $C$ in G n , n c ${G}_{n,n}^{c}$ is called properly colored if any two consecutive edges of C $C$ have distinct colors. A properly colored cycle‐factor of G n ,
Tingting Han +3 more
wiley +1 more source