On lower bounds for the matching number of subcubic graphs

We give a complete description of the set of triples (α, β, γ) of real numbers with the following property. There exists a constant K such that αn3 + βn2 + γn...

Полное описание

Библиографические подробности
Главные авторы:	Haxell, P, Scott, A
Формат:	Journal article
Опубликовано:	Wiley 2016

Схожие документы

Star Coloring of Subcubic Graphs
по: Karthick T., и др.
Опубликовано: (2013-05-01)

Interval Incidence Coloring of Subcubic Graphs
по: Małafiejska Anna, и др.
Опубликовано: (2017-05-01)

On locally irregular decompositions of subcubic graphs
по: Olivier Baudon, и др.
Опубликовано: (2018-01-01)

List Star Edge-Coloring of Subcubic Graphs
по: Kerdjoudj Samia, и др.
Опубликовано: (2018-11-01)

Total Colouring of New Classes of Subcubic graphs
по: Sethuraman G, и др.
Опубликовано: (2022-07-01)

Packing Three-Vertex Paths in a Subcubic Graph
по: Adrian Kosowski, и др.
Опубликовано: (2005-01-01)

Hereditary Equality of Domination and Exponential Domination in Subcubic Graphs
по: Chen Xue-Gang, и др.
Опубликовано: (2021-11-01)

Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter
по: Abboud, Amir, и др.
Опубликовано: (2022)

The tree-achieving set and non-separating independent set problem of subcubic graphs
по: Fayun Cao, и др.
Опубликовано: (2025-01-01)

A New Proof for a Result on the Inclusion Chromatic Index of Subcubic Graphs
по: Lily Chen, и др.
Опубликовано: (2022-01-01)

A bound on the number of perfect matchings in Klee-graphs
по: Marek Cygan, и др.
Опубликовано: (2013-01-01)

Subcubic Min-Plus Product of Structured Matrices
по: Xu, Yinzhan
Опубликовано: (2022)

Beyond the low-degree algorithm: mixtures of subcubes and their applications
по: Chen, Sitan, и др.
Опубликовано: (2022)

Subcubic equivalences between path, matrix, and triangle problems
по: Williams, VV, и др.
Опубликовано: (2021)

Beyond the low-degree algorithm: mixtures of subcubes and their applications
по: Chen, Sitan, и др.
Опубликовано: (2021)

Finding the Best 3-OPT Move in Subcubic Time
по: Giuseppe Lancia, и др.
Опубликовано: (2020-11-01)

Improved lower bounds on book crossing numbers of complete graphs
по: Salazar, G., и др.
Опубликовано: (2014)

Improved lower bounds for book crossing numbers of complete graphs
по: de Klerk, E, и др.
Опубликовано: (2013)

Lower Bound on the Number of Hamiltonian Cycles of Generalized Petersen Graphs
по: Lu Weihua, и др.
Опубликовано: (2020-02-01)

Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product
по: Bringmann, Karl, и др.
Опубликовано: (2021)

An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs
по: Shibsankar Das
Опубликовано: (2020-08-01)

Truly subcubic min-plus product for less structured matrices, with applications
по: Williams, VV, и др.
Опубликовано: (2021)

A General Lower Bound on Gallai-Ramsey Numbers for Non-Bipartite Graphs
по: Colton Magnant
Опубликовано: (2018-01-01)

Lower bounds for the energy of graphs
по: Akbar Jahanbani
Опубликовано: (2018-04-01)

A note on intersecting hypergraphs with large cover number
по: Haxell, P, и др.
Опубликовано: (2017)

A Note on Cycle Lengths in Graphs
по: Gould, R, и др.
Опубликовано: (2002)

Note: Sharp Upper and Lower Bounds on the Number of Spanning Trees in Cartesian Product of Graphs
по: Azarija Jernej
Опубликовано: (2013-09-01)

A lower bound on the $k$-conversion number of graphs of maximum degree $k+1$
по: Christina Mynhardt, и др.
Опубликовано: (2019-09-01)

The matching number and Hamiltonicity of graphs
по: Rao Li
Опубликовано: (2020-09-01)

On Selkow’s Bound on the Independence Number of Graphs
по: Harant Jochen, и др.
Опубликовано: (2019-08-01)

Bounds for the pebbling number of product graphs
по: Nopparat Pleanmani, и др.
Опубликовано: (2022-12-01)

On lower bounds for the metric dimension of graphs
по: Mohsen Jannesari
Опубликовано: (2023-01-01)

An upper bound for the chromatic number of line graphs
по: Andrew D. King, и др.
Опубликовано: (2005-01-01)

The lower bound for number of hexagons in strongly regular graphs with parameters $\lambda=1$ and $\mu=2$
по: Reimbay Reimbayev
Опубликовано: (2024-08-01)

Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes
по: Katona Gyula Y., и др.
Опубликовано: (2014-11-01)

Independence number in graphs and its upper bounds
по: Farzad Shaveisi
Опубликовано: (2025-01-01)

An improved bound on the chromatic number of the Pancake graphs
по: Leen Droogendijk, и др.
Опубликовано: (2024-01-01)

Bounds on the Signed 2-Independence Number in Graphs
по: Volkmann Lutz
Опубликовано: (2013-09-01)

Bounds on the 2-domination number in cactus graphs
по: Mustapha Chellali
Опубликовано: (2006-01-01)

Upper bounds on the bondage number of a graph
по: Vladimir Dimitrov Samodivkin
Опубликовано: (2018-04-01)