AI Chat AI Image Generator AI Video Text to Speech

Turán graphs with bounded matching number

10/26/2022

∙

by Noga Alon, et al.

∙

∙

We determine the maximum possible number of edges of a graph with n vertices, matching number at most s and clique number at most k for all admissible values of the parameters.

Noga Alon
35 publications
Peter Frankl
16 publications

page 1

page 2

page 3

page 4

research

∙ 01/06/2011

Extending Bron Kerbosch for Solving the Maximum Weight Clique Problem

This contribution extends the Bron Kerbosch algorithm for solving the ma...

0 Brijnesh Jain, et al. ∙

research

∙ 01/30/2022

A DFS Algorithm for Maximum Matchings in General Graphs

In this paper, we propose a depth-first search (DFS) algorithm for searc...

0 Tony T. Lee, et al. ∙

research

∙ 03/15/2021

Maximum Number of Steps of Topswops on 18 and 19 Cards

Let f(n) be the maximum number of steps of Topswops on n cards. In this ...

0 Kento Kimura, et al. ∙

research

∙ 06/14/2023

Ramsey numbers of connected 4-clique matching

We determine the exact value of the 2-color Ramsey number of a connected...

0 Krit Kanopthamakun, et al. ∙

research

∙ 10/01/2019

Complexity of Stability

Graph parameters such as the clique number, the chromatic number, and th...

0 Fabian Frei, et al. ∙

research

∙ 07/26/2023

Cliqueful graphs as a means of calculating the maximal number of maximum cliques of simple graphs

A simple graph on n vertices may contain a lot of maximum cliques. But h...

0 Daniel Pfeifer, et al. ∙

research

∙ 02/26/2018

On tradeoffs between width- and fill-like graph parameters

In this work we consider two two-criteria optimization problems: given a...

0 Dariusz Dereniowski, et al. ∙