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...

Descripció completa

Dades bibliogràfiques
Autors principals:	Haxell, P, Scott, A
Format:	Journal article
Publicat:	Wiley 2016

Ítems similars

Star Coloring of Subcubic Graphs
per: Karthick T., et al.
Publicat: (2013-05-01)

Interval Incidence Coloring of Subcubic Graphs
per: Małafiejska Anna, et al.
Publicat: (2017-05-01)

On locally irregular decompositions of subcubic graphs
per: Olivier Baudon, et al.
Publicat: (2018-01-01)

List Star Edge-Coloring of Subcubic Graphs
per: Kerdjoudj Samia, et al.
Publicat: (2018-11-01)

Total Colouring of New Classes of Subcubic graphs
per: Sethuraman G, et al.
Publicat: (2022-07-01)

Packing Three-Vertex Paths in a Subcubic Graph
per: Adrian Kosowski, et al.
Publicat: (2005-01-01)

Hereditary Equality of Domination and Exponential Domination in Subcubic Graphs
per: Chen Xue-Gang, et al.
Publicat: (2021-11-01)

Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter
per: Abboud, Amir, et al.
Publicat: (2022)

The tree-achieving set and non-separating independent set problem of subcubic graphs
per: Fayun Cao, et al.
Publicat: (2025-01-01)

A New Proof for a Result on the Inclusion Chromatic Index of Subcubic Graphs
per: Lily Chen, et al.
Publicat: (2022-01-01)

A bound on the number of perfect matchings in Klee-graphs
per: Marek Cygan, et al.
Publicat: (2013-01-01)

Subcubic Min-Plus Product of Structured Matrices
per: Xu, Yinzhan
Publicat: (2022)

Beyond the low-degree algorithm: mixtures of subcubes and their applications
per: Chen, Sitan, et al.
Publicat: (2022)

Subcubic equivalences between path, matrix, and triangle problems
per: Williams, VV, et al.
Publicat: (2021)

Beyond the low-degree algorithm: mixtures of subcubes and their applications
per: Chen, Sitan, et al.
Publicat: (2021)

Finding the Best 3-OPT Move in Subcubic Time
per: Giuseppe Lancia, et al.
Publicat: (2020-11-01)

Improved lower bounds on book crossing numbers of complete graphs
per: Salazar, G., et al.
Publicat: (2014)

Improved lower bounds for book crossing numbers of complete graphs
per: de Klerk, E, et al.
Publicat: (2013)

Lower Bound on the Number of Hamiltonian Cycles of Generalized Petersen Graphs
per: Lu Weihua, et al.
Publicat: (2020-02-01)

Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product
per: Bringmann, Karl, et al.
Publicat: (2021)

An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs
per: Shibsankar Das
Publicat: (2020-08-01)

Truly subcubic min-plus product for less structured matrices, with applications
per: Williams, VV, et al.
Publicat: (2021)

A General Lower Bound on Gallai-Ramsey Numbers for Non-Bipartite Graphs
per: Colton Magnant
Publicat: (2018-01-01)

Lower bounds for the energy of graphs
per: Akbar Jahanbani
Publicat: (2018-04-01)

A note on intersecting hypergraphs with large cover number
per: Haxell, P, et al.
Publicat: (2017)

A Note on Cycle Lengths in Graphs
per: Gould, R, et al.
Publicat: (2002)

Note: Sharp Upper and Lower Bounds on the Number of Spanning Trees in Cartesian Product of Graphs
per: Azarija Jernej
Publicat: (2013-09-01)

A lower bound on the $k$-conversion number of graphs of maximum degree $k+1$
per: Christina Mynhardt, et al.
Publicat: (2019-09-01)

The matching number and Hamiltonicity of graphs
per: Rao Li
Publicat: (2020-09-01)

On Selkow’s Bound on the Independence Number of Graphs
per: Harant Jochen, et al.
Publicat: (2019-08-01)

Bounds for the pebbling number of product graphs
per: Nopparat Pleanmani, et al.
Publicat: (2022-12-01)

On lower bounds for the metric dimension of graphs
per: Mohsen Jannesari
Publicat: (2023-01-01)

An upper bound for the chromatic number of line graphs
per: Andrew D. King, et al.
Publicat: (2005-01-01)

The lower bound for number of hexagons in strongly regular graphs with parameters $\lambda=1$ and $\mu=2$
per: Reimbay Reimbayev
Publicat: (2024-08-01)

Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes
per: Katona Gyula Y., et al.
Publicat: (2014-11-01)

Independence number in graphs and its upper bounds
per: Farzad Shaveisi
Publicat: (2025-01-01)

An improved bound on the chromatic number of the Pancake graphs
per: Leen Droogendijk, et al.
Publicat: (2024-01-01)

Bounds on the Signed 2-Independence Number in Graphs
per: Volkmann Lutz
Publicat: (2013-09-01)

Bounds on the 2-domination number in cactus graphs
per: Mustapha Chellali
Publicat: (2006-01-01)

Upper bounds on the bondage number of a graph
per: Vladimir Dimitrov Samodivkin
Publicat: (2018-04-01)