AI Chat AI Image Generator AI Video Text to Speech

Kings in Multipartite Hypertournaments

11/11/2020
∙
by   Jiangdong Ai, et al.
∙
0
∙

In his paper "Kings in Bipartite Hypertournaments" (Graphs & Combinatorics 35, 2019) Petrovic stated two conjectures on 4-kings in multipartite hypertournaments. We prove one of these conjectures and give counterexamples for the other.

READ FULL TEXT

page 1

page 2

page 3

page 4

Related Research

research
∙ 07/31/2021

Bipartite Graft III: General Case

This paper is a sequel of our previous paper (N. Kita: Bipartite graft I...
0 Nanao Kita, et al. ∙
research
∙ 04/12/2021

Efficient Algorithm for Checking 2-Chordal (Doubly Chordal) Bipartite Graphs

We present an algorithm for determining whether a bipartite graph G is 2...
0 Austin Alderete, et al. ∙
research
∙ 03/29/2019

Sparse graphs are near-bipartite

A multigraph G is near-bipartite if V(G) can be partitioned as I,F such ...
0 Daniel W. Cranston, et al. ∙
research
∙ 12/07/2018

Counting independent sets in graphs with bounded bipartite pathwidth

We show that a simple Markov chain, the Glauber dynamics, can efficientl...
0 Martin Dyer, et al. ∙
research
∙ 01/19/2018

Quasimonotone graphs

For any class C of bipartite graphs, we define quasi-C to be the class o...
0 Martin Dyer, et al. ∙
research
∙ 07/06/2020

On B_1-EPG and EPT graphs

This research contains as a main result the prove that every Chordal B_1...
0 Liliana Alcón, et al. ∙
research
∙ 08/03/2018

Searching for square-complementary graphs: non-existence results and complexity of recognition

A graph is square-complementary (squco, for short) if its square and com...
0 Ratko Darda, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal