<em id="zlul0"></em><dl id="zlul0"><menu id="zlul0"></menu></dl>

    <em id="zlul0"></em>

      <dl id="zlul0"></dl>
        <div id="zlul0"><tr id="zlul0"><object id="zlul0"></object></tr></div>
        <em id="zlul0"></em>

        <div id="zlul0"><ol id="zlul0"></ol></div>

        Questions tagged [graph-theory]

        Questions about the branch of combinatorics called graph theory (not to be used for questions concerning the graph of a function). This tag can be further specialized via using it in combination with more specialized tags such as extremal-graph-theory, spectral-graph-theory, algebraic-graph-theory, topological-graph-theory, random-graphs, graph-colorings and several others.

        Filter by
        Sorted by
        Tagged with
        1
        vote
        0answers
        58 views

        Bounds on chromatic number when maximum degree is large

        For a regular graph with $n$ vertices and maximum degree $\Delta$, it is easy to see that the chromatic number, $\chi\le\frac{n}{2}$ if $\frac{n}{2}\le\Delta\lt n-1$(since a regular graph on $n$ ...
        2
        votes
        1answer
        115 views

        Chromatic number of the linear graph on $[\omega]^\omega$

        Let $[\omega]^\omega$ denote the set of infinite subsets of $\omega$. Let $$E = \{\{a,b\}: a,b\in [\omega]^\omega\text{ and } |a\cap b| = 1\}.$$ It is clear that $G = ([\omega]^\omega, E)$ has no ...
        1
        vote
        1answer
        39 views

        Clarifications regarding conformability in graph colorings

        As an outgrowth of this question, I have another question, that is, why not the definition of conformability includes a $\Delta$ vertex coloring also, instead of only $\Delta+1$ coloring of vertices. ...
        1
        vote
        0answers
        78 views

        A simple case of a strong version of the Berge-Fulkerson conjecture

        UPDATE 28 June 2019 A counterexample for Conjecture 2 has been provided. The conjecture is now demoted again to guess. The text has been updated to reflect this change, and there is now a new ...
        1
        vote
        0answers
        19 views

        Perfect matchings and edge cuts in cubic graphs - part 1

        Let $G$ be a bridgeless cubic (simple) graph, and let $M$ be a perfect matching in $G$. $G-M$ will necessarily be a set of circuits. For example, if we delete a perfect matching from $K_{3,3}$ we ...
        2
        votes
        1answer
        124 views

        Graceful graphs all of whose vertices are labelled with primes or squares

        Do graceful graphs exist with more than any arbitrarily large number of vertices, all of which are labelled with a prime or non-negative square number. Recall that a graceful graph is a graph with m ...
        8
        votes
        0answers
        117 views

        Has anyone implemented a circle graph recognition algorithm?

        A double occurrence word is a circular string of length $2n$ over an alphabet of size $n$ with each letter occurring exactly twice, for example: ABACCDBD Given a ...
        2
        votes
        0answers
        137 views

        Structure of color critical graph

        Let $G$ be a $k$-color critical graph on $N$ vertices. It is a known fact that every vertex of $G$ has at least $k-1$ neighbors (there are more results available on minimum number of edges in color ...
        1
        vote
        2answers
        95 views

        Upper bounds for the second largest eigenvalue in terms of degree?

        I am looking for upper bounds on the second largest eigenvalue, $\lambda_2(G)$ of a given graph $G$, with respect to minimum/maximum degrees of the graph. I looked around for some existing bounds most ...
        3
        votes
        0answers
        35 views

        Matching number versus Independence number in a graph

        I am looking at partial functions f:V -> V on a finite graph (undirected no loops or multiple edges) G=(V,E) such that 1) The range f(V) is an independent set of vertices. 2) The "kernel" ...
        1
        vote
        2answers
        60 views

        Upper bound on the length of chordless cycles in d-regular graphs

        Given a $d$-regular graph with $n$ vertices is there a known (non-trivial) upper bound on the length of chordless cycles in it (presumably as a function of $d$ and $n$)? I wasn't able to find anything ...
        1
        vote
        1answer
        97 views

        Find the number of edges

        Let $\langle V_1, E_1 \rangle, \langle V_2, E_2 \rangle$ and $\langle V_3, E_3\rangle$ be any three undirected simple graphs with $m$, $n$ and $p$ number of edges, respectively such that $E_2$ and $...
        0
        votes
        0answers
        70 views

        How is the following graph operation defined in the given research paper?

        enter image description hereI am unable to understand the graph operation defined in the following paper https://www.sciencedirect.com/science/article/pii/S0972860017301706. Can someone kindly ...
        6
        votes
        0answers
        122 views

        Generalized graph-minor theorem?

        Consider the following generalized graph-minor theorem: GM($κ,λ$): Given any collection $S$ of $κ$ simple undirected graphs each with less than $λ$ vertices, there are distinct graphs $G,H$ in $S$ ...
        3
        votes
        0answers
        32 views

        Groups that can occur as graph automorphisms of a fixed size graph

        From theorem $4$ and corollary $1$ in this book we have that graph isomorphism has to do with automorphism group of a graph. We also know every group is the automorphism group of a graph by Frucht's ...

        15 30 50 per page
        山西福彩快乐十分钟
          <em id="zlul0"></em><dl id="zlul0"><menu id="zlul0"></menu></dl>

          <em id="zlul0"></em>

            <dl id="zlul0"></dl>
              <div id="zlul0"><tr id="zlul0"><object id="zlul0"></object></tr></div>
              <em id="zlul0"></em>

              <div id="zlul0"><ol id="zlul0"></ol></div>
                <em id="zlul0"></em><dl id="zlul0"><menu id="zlul0"></menu></dl>

                <em id="zlul0"></em>

                  <dl id="zlul0"></dl>
                    <div id="zlul0"><tr id="zlul0"><object id="zlul0"></object></tr></div>
                    <em id="zlul0"></em>

                    <div id="zlul0"><ol id="zlul0"></ol></div>
                    特工简.布隆德归来援彩金 德国斯图加特足球俱乐部 天津快乐十分走势500w 古代锁子甲 K歌乐韵免费试玩 彩票开奖双色球 nba篮彩投注比例 鬼佬大哥大 广东快乐10分开奖走试 魂斗罗归来图标